全文获取类型
收费全文 | 531篇 |
免费 | 259篇 |
国内免费 | 61篇 |
专业分类
851篇 |
出版年
2024年 | 6篇 |
2023年 | 12篇 |
2022年 | 15篇 |
2021年 | 12篇 |
2020年 | 25篇 |
2019年 | 21篇 |
2018年 | 16篇 |
2017年 | 48篇 |
2016年 | 54篇 |
2015年 | 34篇 |
2014年 | 70篇 |
2013年 | 40篇 |
2012年 | 61篇 |
2011年 | 52篇 |
2010年 | 32篇 |
2009年 | 54篇 |
2008年 | 36篇 |
2007年 | 38篇 |
2006年 | 55篇 |
2005年 | 34篇 |
2004年 | 22篇 |
2003年 | 18篇 |
2002年 | 19篇 |
2001年 | 12篇 |
2000年 | 7篇 |
1999年 | 11篇 |
1998年 | 8篇 |
1997年 | 1篇 |
1996年 | 4篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 6篇 |
排序方式: 共有851条查询结果,搜索用时 0 毫秒
21.
22.
23.
24.
25.
A learning tabu search for a truck allocation problem with linear and nonlinear cost components 下载免费PDF全文
The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015 相似文献
26.
We consider a loss system with a fixed budget for servers. The system owner's problem is choosing the price, and selecting the number and quality of the servers, in order to maximize profits, subject to a budget constraint. We solve the problem with identical and different service rates as well as with preemptive and nonpreemptive policies. In addition, when the policy is preemptive, we prove the following conservation law: the distribution of the total service time for a customer entering the slowest server is hyperexponential with expectation equal to the average service rate independent of the allocation of the capacity. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 81–97, 2015 相似文献
27.
广泛工作在ISM(Industrial,Scientific and Medical)频段的无线传感器网络面临严重的频谱稀缺问题。在无线通信中,动态频谱分配被认为是提高频谱效能的重要途径。针对典型集中式管理的认知无线传感器网络设计了基于图着色结合负载强度的高效频谱分配算法。首先在协议干扰模型下确保频谱资源在空间上充分利用,随后综合考虑节点负载强度与公平性建立优化模型并按照乘子法加拟牛顿法框架求解最优值。仿真实验表明算法与固定频谱分配方式和传统自适应频谱分配算法相比,在系统吞吐量和节点缓冲区队列长度两个关键性能指标上具有显著优势。 相似文献
28.
应用具有量子行为的粒子群优化算法,对支持向量(SVM)进行参数优化研究.根据支持向量机的分类准确率和泛化能力之间的关系,应用QPSO算法选取比较优秀的参数模型,比较参数模型的各项性能,选取最适合实际需要的参数模型.仿真表明,QPSO算法的SVM模型与PSO算法相比在分类准确率和泛化能力上均获得更好的效果,经QPSO优化后的SVM整体性能明显提高. 相似文献
29.
Eyal Pecht 《Defence and Peace Economics》2017,28(3):367-399
This study develops a dynamic model that integrates military intelligence into the defense capability of the country and the optimal allocation of its government budget. We assert that the effectiveness of the country’s military intelligence is contingent on the quality of its human capital, which, in turn, implies a long-term positive relationship between the government’s various civilian expenditures and its capacity to achieve a cost-effective intelligence and, hence, military capability. This relationship is developed within a multiple-period arms race model between two rivals. Using this model and stylized data for the Israeli–Syrian arms race, we show that an appropriate budget shift from defense to civilian expenditures during the initial periods of the planning horizon will gradually (over a decade, say) increase the quality of human capital in the country and, thus, the effectiveness of its intelligence, which, in turn, will increase the country’s future security and welfare. 相似文献
30.
Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems 下载免费PDF全文
Honggang Wang 《海军后勤学研究》2017,64(4):305-322
Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017 相似文献