全文获取类型
收费全文 | 1005篇 |
免费 | 99篇 |
国内免费 | 24篇 |
专业分类
化学 | 64篇 |
力学 | 24篇 |
综合类 | 17篇 |
数学 | 878篇 |
物理学 | 145篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 36篇 |
2021年 | 38篇 |
2020年 | 23篇 |
2019年 | 23篇 |
2018年 | 18篇 |
2017年 | 42篇 |
2016年 | 52篇 |
2015年 | 26篇 |
2014年 | 61篇 |
2013年 | 64篇 |
2012年 | 46篇 |
2011年 | 44篇 |
2010年 | 38篇 |
2009年 | 70篇 |
2008年 | 69篇 |
2007年 | 57篇 |
2006年 | 56篇 |
2005年 | 54篇 |
2004年 | 38篇 |
2003年 | 27篇 |
2002年 | 36篇 |
2001年 | 21篇 |
2000年 | 14篇 |
1999年 | 14篇 |
1998年 | 22篇 |
1997年 | 26篇 |
1996年 | 20篇 |
1995年 | 17篇 |
1994年 | 8篇 |
1993年 | 9篇 |
1992年 | 7篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1973年 | 2篇 |
排序方式: 共有1128条查询结果,搜索用时 15 毫秒
1.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
2.
一类经典”秘书问题”的推广 总被引:2,自引:0,他引:2
”秘书问题”在最优停时理论的发展中曾起过重要作用 ,实际中的一类问题与”秘书问题”有类似之处 ,但比”秘书问题”更复杂 .本文将经典”秘书问题”进行推广 ,建立了一类比经典”秘书问题”更有实际意义的模型 ,并给出了该类模型的解 . 相似文献
3.
In this paper, a locally computed suboptimal control strategy for a class of interconnected systems is introduced. First, optimal statefeedback control equations are derived for a finite-horizon quadratic cost. Then, the control for each subsystem is separated into two portions. The first portion stabilizes the isolated subsystem, and the second portion corresponds to the interactions. To achieve a locally calculable control, an approximation to the optimal control equations is introduced, and two iterative suboptimal control algorithms are developed. In the first algorithm, the initial conditions of subsystems are assumed to be known; in the second algorithm, this information is replaced by statistical distributions. The orders of errors in the iterations of the algorithm and in the suboptimality are given in terms of interconnections. An example with comparisons is also included to show the performance of the approach. 相似文献
4.
“Optimization of aircraft maintenance/support infrastructure using genetic algorithms—level of repair analysis” 总被引:4,自引:0,他引:4
Level of repair analysis (LORA) is an approach used during the design stage of complex equipment for analysis of the cost
effectiveness of competing maintenance strategies. LORA is carried as a part of the life cycle cost and cost of ownership
analysis and plays a significant role in minimizing the life cycle cost and cost of ownership of the capital equipment. Since
many purchasing decisions of complex equipment are based on cost of ownership, it has become essential to carry out LORA to
compete in the market. In this paper, we develop a mathematical model for LORA and propose a solution methodology based on
genetic algorithms. The concept is illustrated using a hypothetical aircraft engine. 相似文献
5.
本在Glover—Klingman算法及最小费用支撑树对策的基础上,讨论了最小费用k度限制树对策问题.利用威胁、旁支付理论制订了两种规则,并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解,从而证明了在这两种规则下其核心非空. 相似文献
6.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献
7.
The constrained optimization problem with a quadratic cost functional and two quadratic equality constraints has been studied by Bar-on and Grasse, with positive-definite matrix in the objective. In this note, we shall relax the matrix in the objective to be positive semidefinite. A necessary and sufficient condition to characterize a local optimal solution to be global is established. Also, a perturbation scheme is proposed to solve this generalized problem. 相似文献
8.
We examine the resource allocation problem of partitioning identical servers into two parallel pooling centers, and simultaneously
assigning job types to pooling centers. Each job type has a distinct Poisson arrival rate and a distinct holding cost per
unit time. Each pooling center becomes a queueing system with an exponential service time distribution. The goal is to minimize
the total holding cost. The problem is shown to be polynomial if a job type can be divided between the pooling centers, and
NP-hard if dividing job types is not possible. When there are two servers and jobs cannot be divided, we demonstrate that
the two pooling center configuration is rarely optimal. A heuristic which checks the single pooling center has an upper bound
on the relative error of 4/3. The heuristic is extended for the multiple server problem, where relative error is bounded above
by the number of servers.
相似文献
9.
The single machine group scheduling problem is considered. Jobs are classified into several groups on the basis of group technology, i.e. jobs of the same group have to be processed jointly. A machine set-up time independent of the group sequence is needed between each two consecutive groups. A schedule specifies the sequence of groups and the sequence of jobs in each group. The quality of a schedule is measured by the criteriaF
1, ...,F
m ordered by their relative importance. The objective is to minimize the least important criterionF
m subject to the schedule being optimal with respect to the more important criterionF
m–1 which is minimized on the set of schedules minimizing criterionF
m–2 and so on. The most important criterion isF
1, which is minimized on the set of all feasible schedules. An approach to solve this multicriterion problem in polynomial time is presented if functionsF
1, ...,F
m have special properties. The total weighted completion time and the total weighted exponential time are the examples of functionsF
1, ...,F
m–1 and the maximum cost is an example of functionF
m for which our approach can be applied.The research of the authors was partially supported by a KBN Grant No. 3 P 406 003 05, the Fundamental Research Fund of Belarus, Project N 60-242, and the Deutsche Forschungsgemeinschaft, Project Schema, respectively. The paper was completed while the first author was visiting the University of Melbourne. 相似文献
10.
LetN = (G, T, c, a) be a network, whereG is an undirected graph,T is a distinguished subset of its vertices (calledterminals), and each edgee ofG has nonnegative integer-valuedcapacity c(e) andcost a(e). Theminimum cost maximum multi(commodity)flow problem (*) studied in this paper is to find ac-admissible multiflowf inG such that: (i)f is allowed to contain partial flows connecting any pairs of terminals, (ii) the total value off is as large as possible, and (iii) the total cost off is as small as possible, subject to (ii). This generalizes, on one hand, the undirected version of the classical minimum cost maximum flow problem (when |T| = 2), and, on the other hand, the problem of finding a maximum fractional packing ofT-paths (whena 0). Lovász and Cherkassky independently proved that the latter has a half-integral optimal solution.A pseudo-polynomial algorithm for solving (*) has been developed earlier and, as its consequence, the theorem on the existence of a half-integral optimal solution for (*) was obtained. In the present paper we give a direct, shorter, proof of this theorem. Then we prove the existence of a half-integral optimal solution for the dual problem. Finally, we show that half-integral optimal primal and dual solutions can be designed by a combinatorial strongly polynomial algorithm, provided that some optimal dual solution is known (the latter can be found, in strongly polynomial time, by use of a version of the ellipsoid method).This work was partially supported by Chaire municipale, Mairie de Grenoble, France. 相似文献