全文获取类型
收费全文 | 686篇 |
免费 | 127篇 |
国内免费 | 55篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 10篇 |
2021年 | 15篇 |
2020年 | 17篇 |
2019年 | 13篇 |
2018年 | 11篇 |
2017年 | 31篇 |
2016年 | 40篇 |
2015年 | 32篇 |
2014年 | 46篇 |
2013年 | 57篇 |
2012年 | 52篇 |
2011年 | 61篇 |
2010年 | 41篇 |
2009年 | 67篇 |
2008年 | 28篇 |
2007年 | 44篇 |
2006年 | 58篇 |
2005年 | 48篇 |
2004年 | 32篇 |
2003年 | 27篇 |
2002年 | 14篇 |
2001年 | 21篇 |
2000年 | 19篇 |
1999年 | 12篇 |
1998年 | 10篇 |
1997年 | 7篇 |
1996年 | 8篇 |
1995年 | 8篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有868条查询结果,搜索用时 15 毫秒
21.
刘丽梅 《军械工程学院学报》1999,(3)
引入“DC”空间的概念,研究了带紧扰动的m-增生算子的满值性问题,改进了Kartsatos、Deimling、周海云以及徐宗本等人的结果。 相似文献
22.
机载红外搜索跟踪系统 总被引:2,自引:0,他引:2
红外搜索和跟踪(IRST) 系统是迅速探测红外威胁源的存在, 识别威胁源的种类,测定威胁源的方位并报警的一种光电系统。介绍了对机载IRST的性能要求, 美国和欧洲等国对机载IRST的研制及装备概况, 分析了今后机载IRST系统的发展方向。 相似文献
23.
This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
24.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
25.
王倩 《中国人民武装警察部队学院学报》2011,(7):81-82
在教学中运用建构学习理论,针对“基于经验的知识建构活动”进行有益尝试。在此理论背景下,教师最重要的任务是利用三个层次的建构性经验源为学生提供知识建构的良好条件,并探讨这一理念在教学中的具体应用及其效果。 相似文献
26.
A. Garnaev 《海军后勤学研究》2007,54(1):109-114
This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λi (μi) for Player 1 (Player 2) such that pi(1 ? exp(?λixi)) (pi(1 ? exp(?μiyi))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort xi (yi) applied at point i where pi ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q1 and Player 2 gets q2 where q1 + q2 ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
27.
Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
28.
Vendor‐managed revenue‐sharing arrangements are common in the newspaper and other industries. Under such arrangements, the supplier decides on the level of inventory while the retailer effectively operates under consignment, sharing the sales revenue with his supplier. We consider the case where the supplier is unable to predict demand, and must base her decisions on the retailer‐supplied probabilistic forecast for demand. We show that the retailer's best choice of a distribution to report to his supplier will not be the true demand distribution, but instead will be a degenerate distribution that surprisingly induces the supplier to provide the system‐optimal inventory quantity. (To maintain credibility, the retailer's reports of daily sales must then be consistent with his supplied forecast.) This result is robust under nonlinear production costs and nonlinear revenue‐sharing. However, if the retailer does not know the supplier's production cost, the forecast “improves” and could even be truthful. That, however, causes the supplier's order quantity to be suboptimal for the overall system. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
29.
30.
庞坤 《中国人民武装警察部队学院学报》2007,23(4):88-89
极限是微积分学的核心概念。极限概念及其发展过程中充满辨证思维,蕴含着深刻的哲学思想,体现了辨证法的联系论、对立统一律、否定之否定律。 相似文献