全文获取类型
收费全文 | 144篇 |
免费 | 47篇 |
国内免费 | 15篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 5篇 |
2019年 | 4篇 |
2018年 | 4篇 |
2017年 | 9篇 |
2016年 | 11篇 |
2015年 | 15篇 |
2014年 | 4篇 |
2013年 | 10篇 |
2012年 | 15篇 |
2011年 | 16篇 |
2010年 | 13篇 |
2009年 | 11篇 |
2008年 | 11篇 |
2007年 | 13篇 |
2006年 | 11篇 |
2005年 | 8篇 |
2004年 | 3篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 9篇 |
1998年 | 4篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1994年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有206条查询结果,搜索用时 171 毫秒
31.
32.
33.
卫星任务规划与调度是空间资源管理的重要内容之一,其目的在于为卫星系统的任务计划编制提供科学合理的决策手段与依据。卫星任务调度问题的重要特点在于,调度任务存在可见时间窗口约束。只有在可见时间窗口内,调度任务才可能执行并完成。在进行合理假设的基础上,建立卫星任务调度问题的约束规划模型。对基本禁忌搜索算法进行改进,提出了模型求解的变邻域禁忌搜索算法。应用结果表明,约束规划模型的建立与求解是合理的。 相似文献
34.
Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming 下载免费PDF全文
It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code. 相似文献
35.
36.
The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well‐formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
37.
38.
39.
往返搜索是一种最常见的搜索样式,其搜索效能与搜索宽度、发现距离、搜索速度、突破速度等因素密切相关。在建立往返搜索行动模型的基础上,通过仿真实验得到耕耘数据,进而通过数据分析和处理得到往返搜索发现概率的经验公式。应用经验公式并结合声纳探测模型,对多搜索艇分段封锁搜索案例进行了优化研究。 相似文献
40.