全文获取类型
收费全文 | 357篇 |
免费 | 1篇 |
国内免费 | 5篇 |
学科分类
数理化 | 363篇 |
出版年
2023年 | 7篇 |
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 9篇 |
2019年 | 11篇 |
2018年 | 13篇 |
2017年 | 6篇 |
2016年 | 7篇 |
2015年 | 5篇 |
2014年 | 11篇 |
2013年 | 17篇 |
2012年 | 21篇 |
2011年 | 27篇 |
2010年 | 21篇 |
2009年 | 36篇 |
2008年 | 17篇 |
2007年 | 19篇 |
2006年 | 25篇 |
2005年 | 18篇 |
2004年 | 14篇 |
2003年 | 12篇 |
2002年 | 9篇 |
2001年 | 10篇 |
2000年 | 7篇 |
1999年 | 5篇 |
1998年 | 5篇 |
1997年 | 2篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有363条查询结果,搜索用时 15 毫秒
1.
Vivek F. Farias 《Operations Research Letters》2006,34(2):180-190
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility. 相似文献
2.
Tor Schoenmeyr David Yu Zhang 《Journal of Algorithms in Cognition, Informatics and Logic》2005,57(2):130-139
The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method. 相似文献
3.
4.
We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help. 相似文献
5.
Pre—Separation Axioms in Fuzzifying Topology 总被引:1,自引:0,他引:1
K.M.AbdEl-Hakeim F.M.Zeyada 《模糊系统与数学》2003,17(1):28-36
1 IntroductionYing[5,6 ] introduced and elementally developed so called fuzzifying topology with the semanticmethod of continuous valued L ogic.Shen[7] introduced and studied T0 -,T1-,T2 (Hausdorff) -,T3(regularity) -,T4 (normality) -separation axioms in fuzzifying topology.In [3 ]the concepts of thefamily of fuzzifying pre-open sets,fuzzifying pre-neighbourhood structure of a point and fuzzifyingpre-closure are introduced and studied.It is worth to mention that pre-separation axioms are … 相似文献
6.
基于伽罗瓦连接,分别在交换伴随对与对合剩余格条件下,讨论了模糊概念格的四种定义形式。并证明了在对合剩余格上,对偶性成立,四种模糊算子将具有与经典意义下一致的相互关系。最后我们提出了一种基于模糊概念格的模糊推理规则,并证明了其还原性。 相似文献
7.
N. D. Botkin 《Applied Mathematics and Optimization》1995,32(2):195-210
A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm isO(dd! (m + n)), wherem andn are cardinalities of sets to be separated. The expected running time of the algorithm for solving quadratic problems isO(dd! s) wheres is the number of inequality constraints. These algorithms are based on the ideas of Seidel's linear programming algorithm [6]. They are closely related to algorithms of [8], [2], and [9] and belong to an abstract class of algorithms investigated in [1]. The algorithm for solving quadratic problems has some features of the one proposed in [7].This research was done when the author was supported by the Alexander von Humboldt Foundation, Germany.On leave from the Institute of Mathematics and Mechanics, Ural Department of the Russian Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str. 16, Russia. 相似文献
8.
10.
以L~*-格值上Lukasiewicz蕴含算子为工具引入了直觉I-Fuzzy拓扑空间中导集概念,接着给出它的一些性质,最后证明了直觉I-Fuzzy拓扑空间中导集的杨忠道定理. 相似文献