全文获取类型
收费全文 | 220篇 |
免费 | 5篇 |
国内免费 | 4篇 |
专业分类
化学 | 8篇 |
综合类 | 1篇 |
数学 | 214篇 |
物理学 | 6篇 |
出版年
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 2篇 |
2020年 | 2篇 |
2019年 | 1篇 |
2017年 | 3篇 |
2016年 | 1篇 |
2015年 | 1篇 |
2014年 | 4篇 |
2013年 | 7篇 |
2012年 | 3篇 |
2011年 | 5篇 |
2010年 | 6篇 |
2009年 | 6篇 |
2008年 | 14篇 |
2007年 | 12篇 |
2006年 | 7篇 |
2005年 | 21篇 |
2004年 | 10篇 |
2003年 | 6篇 |
2002年 | 12篇 |
2001年 | 17篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 7篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 7篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 16篇 |
1984年 | 10篇 |
1982年 | 2篇 |
1981年 | 1篇 |
排序方式: 共有229条查询结果,搜索用时 15 毫秒
41.
We consider the survivable network design problem — the problem of designing, at minimum cost, a network with edge-connectivity requirements. As special cases, this problem encompasses the Steiner tree problem, the traveling salesman problem and thek-edge-connected network design problem. We establish a property, referred to as the parsimonious property, of the linear programming (LP) relaxation of a classical formulation for the problem. The parsimonious property has numerous consequences. For example, we derive various structural properties of these LP relaxations, we present some algorithmic improvements and we perform tight worst-case analyses of two heuristics for the survivable network design problem.The research of both authors was partially supported by the National Science Foundation under grant ECS-8717970 and the Leaders for manufacturing program at MIT. 相似文献
42.
Optimization heuristics are often compared with each other to determine which one performs best by means of worst-case performance
ratio reflecting the quality of returned solution in the worst case. The domination number is a complement parameter indicating
the quality of the heuristic in hand by determining how many feasible solutions are dominated by the heuristic solution. We
prove that the Max-Regret heuristic introduced by Balas and Saltzman (Oper. Res. 39:150–161, 1991) finds the unique worst possible solution for some instances of the s-dimensional (s≥3) assignment and asymmetric traveling salesman problems of each possible size. We show that the Triple Interchange heuristic
(for s=3) also introduced by Balas and Saltzman and two new heuristics (Part and Recursive Opt Matching) have factorial domination
numbers for the s-dimensional (s≥3) assignment problem. 相似文献
43.
Matti Jrvisalo Ilkka Niemel 《Journal of Algorithms in Cognition, Informatics and Logic》2008,63(1-3):90
The techniques for making decisions (branching) play a central role in complete methods for solving structured instances of propositional satisfiability (SAT). Experimental case studies in specific problem domains have shown that in some cases SAT solvers can determine satisfiability faster if branching in the solver is restricted to a subset of the variables at hand. The underlying idea in these approaches is to prune the search space substantially by restricting branching to strong backdoor sets of variables which guarantee completeness of the search. In this paper we present an extensive experimental evaluation of the effects of structure-based branching restrictions on the efficiency of solving structural SAT instances. Previous work is extended in a number of ways. We study state-of-the-art solver techniques, including clause learning and related heuristics. We provide a thorough analysis of the effect of branching restrictions on the inner workings of the solver, going deeper than merely measuring the solution time. Extending previous studies which have focused on input-restricted branching, we also consider relaxed branching restrictions that are based on underlying structural properties of the variables. 相似文献
44.
Carlo Vercellis 《Annals of Operations Research》1984,1(3):255-271
A probabilistic analysis of the minimum cardinality set covering problem (SCP) is developed, considering a stochastic model of the (SCP), withn variables andm constraints, in which the entries of the corresponding (m, n) incidence matrix are independent Bernoulli distributed random variables, each with constant probabilityp of success. The behaviour of the optimal solution of the (SCP) is then investigated as bothm andn grow asymptotically large, assuming either an incremental model for the evolution of the matrix (for each size, the matrixA is obtained bordering a matrix of smaller size by new columns and rows) or an independent one (for each size, an entirely new set of entries forA are considered). Two functions ofm are identified, which represent a lower and an upper bound onn in order the (SCP) to be a.e. feasible and not trivial. Then, forn lying within these bounds, an asymptotic formula for the optimum value of the (SCP) is derived and shown to hold a.e.The performance of two simple randomized algorithms is then analyzed. It is shown that one of them produces a solution value whose ratio to the optimum value asymptotically approaches 1 a.e. in the incremental model, but not in the independent one, in which case the ratio is proved to be tightly bounded by 2 a.e. Thus, in order to improve the above result, a second randomized algorithm is proposed, for which it is proved that the ratio between the approximate solution value and the optimum approaches 1 a.e. also in the independent model. 相似文献
45.
Colin McDiarmid 《Annals of Operations Research》1984,1(3):183-200
We discuss some results concerned with the behaviour of colouring algorithms on large random graphs. 相似文献
46.
D. de Werra 《European Journal of Operational Research》1985,19(2):151-162
A huge variety of timetabling models have been described in the OR literature; they range from the weekly timetable of a school to the scheduling of courses or exams in a university. Graphs and networks have proven to be useful in the formulation and solution of such problems. Various models will be described with an emphasis on graph theoretical models. 相似文献
47.
Sheldon?H.?JacobsonEmail author Shane?N.?Hall Laura?A.?McLay Jeffrey?E.?Orosz 《Methodology and Computing in Applied Probability》2005,7(2):183-201
Generalized hill climbing (GHC) algorithms provide a framework for modeling local search algorithms for addressing intractable discrete optimization problems. Measures for assessing the finite-time performance of GHC algorithms have been developed using this framework, including the expected number of iterations to visit a predetermined objective function value level. This paper analyzes how the expected number of iterations to visit a predetermined objective function value level can be estimated for cyclical simulated annealing. Cyclical simulated annealing uses a cooling schedule that cycles through a set of temperature values. Computational results with traveling salesman problem instances taken from TSPLIB show how the expected number of iterations to visit solutions with predetermined objective function levels can be estimated for cyclical simulated annealing.AMS 2000 Subject Classification 90-08 Computational Methods: Local Search, 90C59 Heuristics: Simulated Annealing 相似文献
48.
Seydou Traoré Kyle E. Roberts David Allouche Bruce R. Donald Isabelle André Thomas Schiex Sophie Barbe 《Journal of computational chemistry》2016,37(12):1048-1058
One of the main challenges in computational protein design (CPD) is the huge size of the protein sequence and conformational space that has to be computationally explored. Recently, we showed that state‐of‐the‐art combinatorial optimization technologies based on Cost Function Network (CFN) processing allow speeding up provable rigid backbone protein design methods by several orders of magnitudes. Building up on this, we improved and injected CFN technology into the well‐established CPD package Osprey to allow all Osprey CPD algorithms to benefit from associated speedups. Because Osprey fundamentally relies on the ability of to produce conformations in increasing order of energy, we defined new strategies combining CFN lower bounds, with new side‐chain positioning‐based branching scheme. Beyond the speedups obtained in the new ‐CFN combination, this novel branching scheme enables a much faster enumeration of suboptimal sequences, far beyond what is reachable without it. Together with the immediate and important speedups provided by CFN technology, these developments directly benefit to all the algorithms that previously relied on the DEE/ combination inside Osprey* and make it possible to solve larger CPD problems with provable algorithms. © 2016 Wiley Periodicals, Inc. 相似文献
49.
Ramiro Varela Camino R. Vela Jorge Puente María Sierra Inés González-Rodríguez 《Annals of Operations Research》2009,166(1):125-146
We confront a practical cutting stock problem from a production plant of plastic rolls. The problem is a variant of the well-known
one dimensional cutting stock, with particular constraints and optimization criteria defined by the experts of the company.
We start by giving a problem formulation in which optimization criteria have been considered in linear hierarchy according
to expert preferences, and then propose a heuristic solution based on a GRASP algorithm. The generation phase of this algorithm
solves a simplified version which is rather similar to the conventional one dimensional cutting stock. To do that, we propose
a Sequential Heuristic Randomized Procedure (SHRP). Then in the repairing phase, the solution of the simplified problem is
transformed into a solution to the real problem. For experimental study we have chosen a set of problem instances of com-mon
use to compare SHRP with another recent approach. Also, we show by means of examples, how our approach works over instances
taken from the real production process.
All authors are supported by MEC-FEDER Grant TIN2007-67466-C02-01 and by contract CN-05-127 of the University of Oviedo and
the company ERVISA, and by FICYT under grant BP04-021. 相似文献
50.
Quantum thermal machines make use of non-classical thermodynamic resources, one of which include interactions between elements of the quantum working medium. In this paper, we examine the performance of a quasi-static quantum Otto engine based on two spins of arbitrary magnitudes subject to an external magnetic field and coupled via an isotropic Heisenberg exchange interaction. It has been shown earlier that the said interaction provides an enhancement of cycle efficiency, with an upper bound that is tighter than the Carnot efficiency. However, the necessary conditions governing engine performance and the relevant upper bound for efficiency are unknown for the general case of arbitrary spin magnitudes. By analyzing extreme case scenarios, we formulate heuristics to infer the necessary conditions for an engine with uncoupled as well as coupled spin model. These conditions lead us to a connection between performance of quantum heat engines and the notion of majorization. Furthermore, the study of complete Otto cycles inherent in the average cycle also yields interesting insights into the average performance. 相似文献