全文获取类型
收费全文 | 348篇 |
免费 | 5篇 |
国内免费 | 4篇 |
专业分类
化学 | 17篇 |
力学 | 4篇 |
综合类 | 1篇 |
数学 | 292篇 |
物理学 | 43篇 |
出版年
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 2篇 |
2020年 | 1篇 |
2018年 | 3篇 |
2017年 | 4篇 |
2016年 | 5篇 |
2015年 | 3篇 |
2014年 | 15篇 |
2013年 | 24篇 |
2012年 | 24篇 |
2011年 | 18篇 |
2010年 | 30篇 |
2009年 | 39篇 |
2008年 | 43篇 |
2007年 | 33篇 |
2006年 | 21篇 |
2005年 | 9篇 |
2004年 | 6篇 |
2003年 | 6篇 |
2002年 | 4篇 |
2001年 | 8篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 6篇 |
1996年 | 9篇 |
1995年 | 2篇 |
1994年 | 6篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 2篇 |
排序方式: 共有357条查询结果,搜索用时 15 毫秒
1.
2.
George Lagogiannis Christos Makris Athanasios Tsakalidis 《Journal of Discrete Algorithms》2006,4(1):106-141
We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way. 相似文献
3.
4.
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows 总被引:6,自引:0,他引:6
Michael Polacek Richard F. Hartl Karl Doerner Marc Reimann 《Journal of Heuristics》2004,10(6):613-627
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times. 相似文献
5.
We consider the classical problem of searching for a heavier coin in a set of n coins, n-1 of which have the same weight. The weighing device is b-balance which is the generalization of two-arms balance. The minimum numbers of weighings are determined exactly for worst-case sequential algorithm, average-case sequential algorithm, worst-case predetermined algorithm, average-case predetermined algorithm.We also investigate the above search model with additional constraint: each weighing is only allowed to use the coins that are still in doubt. We present a worst-case optimal sequential algorithm and an average-case optimal sequential algorithm requiring the minimum numbers of weighings. 相似文献
6.
This paper describes an optimization technique based on an heuristic procedure which is applied to analyse and improve the efficiency of the design of Global Positioning System (GPS) surveying networks. GPS is a valuable survey tool because of its ability to increase the accuracy, speed and flexibility of a survey. A GPS network can be defined as a number of stations, which are co-ordinated by a series of sessions, formed by placing receivers on stations. The goal is to select the best order in which these sessions can be organised to give the best possible schedule. Generally, solving large networks to optimality requires impractical computational time. This paper proposes a Tabu Search technique which provides optimal or near-optimal solutions for large networks with an acceptable amount of computational effort. Computational results for several case studies with known and unknown optimal schedules have been presented to assess the performance of the proposed technique. 相似文献
7.
Nearly four hundred non-routine organizational decisions were investigated to discover search approaches––determining the frequency of use and success of each search approach uncovered. A “search approach” is made up of a direction and a means to uncover solution ideas. Direction indicates desired results and it can be either implicit or explicit, with an explicit direction offering either a problem or a goal-like target. Solutions can be uncovered by opportunity, bargaining, and chance as well as by rational approaches. Defining a search approach as a direction coupled with a means of search, search approaches were linked with indicators of success, measured by the decision's adoption, value and timeliness, noting frequency. A rational, goal-directed, search approach was more apt to produce successful outcomes. Bargaining with stakeholders to uncover solutions was always combined some of the search approaches in this study, and this merger improved the prospects of success. Searches with an opportunistic or chance (emergent opportunity) features and rational searches with a problem target were more apt to produce unsuccessful outcomes. The means used to come up with a solution had less bearing on success than did the type of direction, with goal-directed searches leading to the best outcomes. Each search approach is discussed to reveal best practices and to offer suggestions to improve practice. 相似文献
8.
A Kind of direct methods is presented for the solution of optimal control problems with state constraints.These methods are sequential quadratic programming methods.At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and Linear approximations to constraints is solved to get a search direction for a merit function.The merit function is formulated by augmenting the Lagrangian funetion with a penalty term.A line search is carried out along the search direction to determine a step length such that the merit function is decreased.The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadrade programming methods. 相似文献
9.
J. A. Hageman R. Wehrens H. A. van Sprang L. M. C. Buydens 《Analytica chimica acta》2003,490(1-2):211-222
Constructing multilayer optical coatings (MOCs) is a difficult large-scale optimisation problem due to the enormous size of the search space. In the present paper, a new approach for designing MOCs is presented using genetic algorithms (GAs) and tabu search (TS). In this approach, it is not necessary to specify how many layers will be present in a design, only a maximum needs to be defined. As it is generally recognised that the existence of specific repeating blocks is beneficial for a design, a specific GA representation of a design is used which promotes the occurrence of repeating blocks. Solutions found by GAs are improved by a new refinement method, based on TS, a global optimisation method which is loosely based on artificial intelligence. The improvements are demonstrated by creating a visible transmitting/infrared reflecting filter with a wide variety of materials. 相似文献
10.
Sherif El-Basil Gani Jashari Jan V. Knop Nenad Trinajstić 《Monatshefte für Chemie / Chemical Monthly》1984,115(11):1299-1312
The reduced graph model, when used in conjunction with the search trees method, provides a novel combinatorial procedure for the enumeration and generation ofKekulé structures. The procedure is suited for large benzenoid hydrocarbons consisting of cata- and thin peri-condensed parts.
Zur Anwendung des Reduced Graph Model im Zusammenhang mit Search Trees zur Ermittlung der Anzahl möglicherKekulé-Strukturen
Zusammenfassung Das Modell erlaubt mit der im Titel genannten Kombination eine neuartige Methode zur Ermittlung und Generierung vonKekulé-Strukturen. Das Verfahren ist für große benzoide Kohlenwasserstoffe geeignet, die aus cata- und (dünnen) peri-kondensierten Teilstrukturen bestehen.相似文献