全文获取类型
收费全文 | 2134篇 |
免费 | 137篇 |
国内免费 | 160篇 |
专业分类
化学 | 1篇 |
晶体学 | 1篇 |
力学 | 2篇 |
综合类 | 30篇 |
数学 | 471篇 |
物理学 | 132篇 |
综合类 | 1794篇 |
出版年
2024年 | 7篇 |
2023年 | 13篇 |
2022年 | 33篇 |
2021年 | 34篇 |
2020年 | 15篇 |
2019年 | 29篇 |
2018年 | 31篇 |
2017年 | 55篇 |
2016年 | 40篇 |
2015年 | 75篇 |
2014年 | 120篇 |
2013年 | 141篇 |
2012年 | 130篇 |
2011年 | 153篇 |
2010年 | 125篇 |
2009年 | 180篇 |
2008年 | 154篇 |
2007年 | 233篇 |
2006年 | 198篇 |
2005年 | 148篇 |
2004年 | 132篇 |
2003年 | 106篇 |
2002年 | 64篇 |
2001年 | 52篇 |
2000年 | 43篇 |
1999年 | 23篇 |
1998年 | 15篇 |
1997年 | 10篇 |
1996年 | 13篇 |
1995年 | 11篇 |
1994年 | 7篇 |
1993年 | 9篇 |
1992年 | 8篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1985年 | 5篇 |
1982年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有2431条查询结果,搜索用时 15 毫秒
1.
2.
在网络建设和运行中,采用测试的方法对其性能进行评估对于网络的正常运营具有重要的意义.本文研究了网络路由收敛性能测试方法,为得到路由收敛性能指标,对OSPF和iBGP的路由收敛时间进行了测量.提出了一种简化的路由收敛时间测量方法,通过测量数据平面的传输性能指标,对路由控制平面的收敛时间进行估算.该方法对于测试设备要求不高,实施简单方便.采用该方法在CERNET2投入运营之前对其进行了路由性能测试,实验结果表明CERNET2在路由变化时具有较好的路由收敛性能. 相似文献
3.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献
4.
Consider a network where two routes are available for users wishing to travel from a source to a destination. On one route (which could be viewed as private transport) service slows as traffic increases. On the other (which could be viewed as public transport) the service frequency increases with demand. The Downs-Thomson paradox occurs when improvements in service produce an overall decline in performance as user equilibria adjust. Using the model proposed by Calvert [10], with a ⋅|M|1 queue corresponding to the private transport route, and a bulk-service infinite server queue modelling the public transport route, we give a complete analysis of this system in the setting of probabilistic routing. We obtain the user equilibria (which are not always unique), and determine their stability.AMS subject classification: 60K30, 90B15, 90B20, 91A10, 91A13This revised version was published online in June 2005 with corrected coverdate 相似文献
5.
Han-xing Wang Xi Hu Qin Zhang 《应用数学学报(英文版)》2007,23(2):235-244
In this paper,we present a random graph model with spatial reuse for a mobile ad hoc network(MANET) based on the dynamic source routing protocol.Many important performance parameters of theMANET are obtained,such as the average flooding distance (AFD),the probability generating function of theflooding distance,and the probability of a flooding route to be symmetric.Compared with the random graphmodel without spatial reuse,this model is much more effective because it has a smaller value of AFD and alarger probability for finding a symmetric valid route. 相似文献
6.
Rafael Caballero Mercedes González Flor M Guerrero Julián Molina Concepción Paralera 《European Journal of Operational Research》2007
In this work we present a multiobjective location routing problem and solve it with a multiobjective metaheuristic procedure. In this type of problem, we have to locate some plants within a set of possible locations to meet the demands of a number of clients with multiple objectives. This type of model is used to solve a problem with real data in the region of Andalusia (Spain). Thus, we study the location of two incineration plants for the disposal of solid animal waste from some preestablished locations in Andalusia, and design the routes to serve the different slaughterhouses in this region. This must be done while taking into account certain economic objectives (start-up, maintenance, and transport costs) and social objectives (social rejection by towns on the truck routes, maximum risk as an equity criterion, and the negative implications for towns close to the plant). 相似文献
7.
首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明.最后对找到最优解后信息素值的变化进行了分析.即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值. 相似文献
8.
李锐 《安徽大学学报(自然科学版)》2003,27(2):35-40
介绍Linux系统中网络服务质量的原理与应用。全文分两个部分,第一部分探讨了Linux系统上QoS的工作原理,Linux在系统内核中实现了QoS,其QoS管理的核心是流量控制,由队列规定、类和过滤器三部分构成;后一部分介绍了Linux系统提供的配置与监控流量控制的用户程序-tc,并给出了一个实际应有的具体案例。 相似文献
9.
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows 总被引:2,自引:0,他引:2
Vehicle routing problem with time windows (VRPTW) involves the routing of a set of vehicles with limited capacity from a central
depot to a set of geographically dispersed customers with known demands and predefined time windows. The problem is solved
by optimizing routes for the vehicles so as to meet all given constraints as well as to minimize the objectives of traveling
distance and number of vehicles. This paper proposes a hybrid multiobjective evolutionary algorithm (HMOEA) that incorporates
various heuristics for local exploitation in the evolutionary search and the concept of Pareto's optimality for solving multiobjective
optimization in VRPTW. The proposed HMOEA is featured with specialized genetic operators and variable-length chromosome representation
to accommodate the sequence-oriented optimization in VRPTW. Unlike existing VRPTW approaches that often aggregate multiple
criteria and constraints into a compromise function, the proposed HMOEA optimizes all routing constraints and objectives simultaneously,
which improves the routing solutions in many aspects, such as lower routing cost, wider scattering area and better convergence
trace. The HMOEA is applied to solve the benchmark Solomon's 56 VRPTW 100-customer instances, which yields 20 routing solutions
better than or competitive as compared to the best solutions published in literature. 相似文献
10.
Martin Skutella 《Mathematical Programming》2002,91(3):493-514
In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex
to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed
along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed
a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various
areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing.
Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results
of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques
do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation
results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally,
we provide results on the hardness of approximation for several variants of the problem.
Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001 相似文献