全文获取类型
收费全文 | 189篇 |
免费 | 2篇 |
国内免费 | 3篇 |
专业分类
化学 | 3篇 |
力学 | 4篇 |
数学 | 177篇 |
物理学 | 10篇 |
出版年
2023年 | 4篇 |
2022年 | 3篇 |
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2018年 | 8篇 |
2017年 | 1篇 |
2016年 | 6篇 |
2015年 | 1篇 |
2014年 | 7篇 |
2013年 | 6篇 |
2012年 | 6篇 |
2011年 | 10篇 |
2010年 | 13篇 |
2009年 | 21篇 |
2008年 | 14篇 |
2007年 | 8篇 |
2006年 | 10篇 |
2005年 | 10篇 |
2004年 | 8篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1983年 | 1篇 |
排序方式: 共有194条查询结果,搜索用时 46 毫秒
121.
We investigate optimal algorithms for optimizing and approximating a general high dimensional smooth and sparse function from the perspective of information based complexity. Our algorithms and analyses reveal several interesting characteristics for these tasks. In particular, somewhat surprisingly, we show that the optimal sample complexity for optimization or high precision approximation is independent of the ambient dimension. In addition, we show that the benefit of randomization could be substantial for these problems. 相似文献
122.
A decentralized random algorithm for flow distribution in complex networks is proposed. The aim is to maintain the maximum flow while satisfying the flow limits of the nodes and links in the network. The algorithm is also used for flow redistribution after a failure in (or attack on) a complex network to avoid a cascaded failure while maintaining the maximum flow in the network. The proposed algorithm is based only on the information about the closest neighbours of each node. A mathematically rigorous proof of convergence with probability 1 of the proposed algorithm is provided. 相似文献
123.
求解一个整数方程的新解法 总被引:1,自引:0,他引:1
ni=1aixi =p是一个由实验数据问题抽象而出的整数方程求非负整数解的数学模型 .为了使该问题实现计算机求解的可能 ,本文首先将原问题转化为讨论一类整数规划最优解问题 .从对应松弛规划问题的目标函数值为 0的最优解出发 ,根据舍入凑整法原则 ,再次将问题转化为另一简化后的整数方程 ,这样大大缩小了解的范围 ,及进一步迅速降低了方程右端的 p值 ,使其在计算机上求解的运算量大大降低而能得以实现 相似文献
124.
Michel X. Goemans Martin Skutella 《Journal of Algorithms in Cognition, Informatics and Logic》2004,50(2):194-214
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cost for opening a facility and also for connecting a customer to a facility, the goal being to minimize the total cost. Often, both in the case of public facilities (such as libraries, municipal swimming pools, fire stations, … ) and private facilities (such as distribution centers, switching stations, … ), we may want to find a ‘fair’ allocation of the total cost to the customers—this is known as the cost allocation problem. A central question in cooperative game theory is whether the total cost can be allocated to the customers such that no coalition of customers has any incentive to build their own facility or to ask a competitor to service them. We establish strong connections between fair cost allocations and linear programming relaxations for several variants of the facility location problem. In particular, we show that a fair cost allocation exists if and only if there is no integrality gap for a corresponding linear programming relaxation; this was only known for the simplest unconstrained variant of the facility location problem. Moreover, we introduce a subtle variant of randomized rounding and derive new proofs for the existence of fair cost allocations for several classes of instances. We also show that it is in general NP-complete to decide whether a fair cost allocation exists and whether a given allocation is fair. 相似文献
125.
Bolesaw Kacewicz 《Journal of Complexity》2004,20(6):821
Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration and approximation problems, for which a speed-up is shown in many important cases by quantum computers with respect to deterministic and randomized algorithms on a classical computer. In this paper, we deal with the randomized and quantum complexity of initial-value problems. For this nonlinear problem, we show that both randomized and quantum algorithms yield a speed-up over deterministic algorithms. Upper bounds on the complexity in the randomized and quantum settings are shown by constructing algorithms with a suitable cost, where the construction is based on integral information. Lower bounds result from the respective bounds for the integration problem. 相似文献
126.
Henrik Björklund 《Discrete Applied Mathematics》2007,155(2):210-229
We suggest the first strongly subexponential and purely combinatorial algorithm for solving the mean payoff games problem. It is based on iteratively improving the longest shortest distances to a sink in a possibly cyclic directed graph.We identify a new “controlled” version of the shortest paths problem. By selecting exactly one outgoing edge in each of the controlled vertices we want to make the shortest distances from all vertices to the unique sink as long as possible. The decision version of the problem (whether the shortest distance from a given vertex can be made bigger than a given bound?) belongs to the complexity class NP∩CONP. Mean payoff games are easily reducible to this problem. We suggest an algorithm for computing longest shortest paths. Player MAX selects a strategy (one edge from each controlled vertex) and player MIN responds by evaluating shortest paths to the sink in the remaining graph. Then MAX locally changes choices in controlled vertices looking at attractive switches that seem to increase shortest paths lengths (under the current evaluation). We show that this is a monotonic strategy improvement, and every locally optimal strategy is globally optimal. This allows us to construct a randomized algorithm of complexity , which is simultaneously pseudopolynomial (W is the maximal absolute edge weight) and subexponential in the number of vertices n. All previous algorithms for mean payoff games were either exponential or pseudopolynomial (which is purely exponential for exponentially large edge weights). 相似文献
127.
Jiří Rohn 《Applications of Mathematics》2007,52(2):105-115
For a real square matrix A and an integer d ? 0, let A (d) denote the matrix formed from A by rounding off all its coefficients to d decimal places. The main problem handled in this paper is the following: assuming that A (d) has some property, under what additional condition(s) can we be sure that the original matrix A possesses the same property? Three properties are investigated: nonsingularity, positive definiteness, and positive invertibility. In all three cases it is shown that there exists a real number α(d), computed solely from A (d) (not from A), such that the following alternative holdsif d > α(d), then nonsingularity (positive definiteness, positive invertibility) of A (d) implies the same property for A if d < α(d) and A (d) is nonsingular (positive definite, positive invertible), then there exists a matrix A′ with A′(d) = A (d) which does not have the respective property.For nonsingularity and positive definiteness the formula for α(d) is the same and involves computation of the NP-hard norm ‖ · ‖∞,1; for positive invertibility α(d) is given by an easily computable formula. 相似文献
128.
129.
Surface roughness effects in a short porous journal bearing with a couple stress fluid 总被引:3,自引:0,他引:3
In this paper, a theoretical study of the effect of surface roughness in hydrodynamic lubrication of a porous journal bearing with couplestress fluid as lubricant is made. The modified Reynolds equations accounting for the couple stresses and randomized surface roughness structure are mathematically derived. The Christensen stochastic theory of hydrodynamic lubrication of rough surfaces is used to study the effects of surface roughness on the static characteristics of a short porous journal bearing with couplestress fluid as lubricant. Further, it is assumed that, the roughness asperity heights are small compared to the film thickness. It is observed that, the effects of surface roughness on the bearing characteristics are more pronounced for couplestress fluids as compared to the Newtonian fluids. 相似文献
130.
The problems of (bi-)proportional rounding of a nonnegative vector or matrix, resp., are written as particular separable convex
integer minimization problems. Allowing any convex (separable) objective function we use the notions of vector and matrix
apportionment problems. As a broader class of problems we consider separable convex integer minimization under linear equality
restrictions Ax = b with any totally unimodular coefficient matrix A. By the total unimodularity Fenchel duality applies, despite the integer restrictions of the variables. The biproportional
algorithm of Balinski and Demange (Math Program 45:193–210, 1989) is generalized and derives from the dual optimization problem.
Also, a primal augmentation algorithm is stated. Finally, for the smaller class of matrix apportionment problems we discuss
the alternating scaling algorithm, which is a discrete variant of the well-known Iterative Proportional Fitting procedure. 相似文献