全文获取类型
收费全文 | 335篇 |
免费 | 153篇 |
国内免费 | 24篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 4篇 |
2020年 | 7篇 |
2019年 | 8篇 |
2018年 | 2篇 |
2017年 | 25篇 |
2016年 | 34篇 |
2015年 | 27篇 |
2014年 | 39篇 |
2013年 | 47篇 |
2012年 | 20篇 |
2011年 | 18篇 |
2010年 | 17篇 |
2009年 | 26篇 |
2008年 | 20篇 |
2007年 | 27篇 |
2006年 | 29篇 |
2005年 | 24篇 |
2004年 | 27篇 |
2003年 | 10篇 |
2002年 | 8篇 |
2001年 | 16篇 |
2000年 | 11篇 |
1999年 | 6篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1996年 | 7篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 7篇 |
1992年 | 4篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有512条查询结果,搜索用时 15 毫秒
271.
一种基于神经网络的磁性目标定位方法 总被引:4,自引:2,他引:2
磁性目标定位问题可归结为一类非线性规划问题的求解 .该问题的最大特点就是其目标函数的计算过程极为繁琐 .而目标函数计算的快慢对磁定位的实时性有很大影响 .在详细研究了目标函数之后 ,给出了目标函数的一种神经网络结构实现 .由于该网络结构易于并行计算和VLSI实现 ,从而可使磁定位的实时性得到改善 . 相似文献
272.
We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions. 相似文献
273.
274.
本文应用多目标决策原理和计算机技术,在分析用户需求的基础上,建立了科研任务项目的预测评价和经费分配模型,并分析了有关模型的关系和解决性质。根据这些模型和决策的特点,简要叙述了该系统的主要功能。我们相信。该系统的应用,将给管理人员提供方便,且使管理进一步科学化,让有限的经费发挥更大的作用。 相似文献
275.
We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003. 相似文献
276.
We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
277.
In this paper we address the problem of how to decide when to terminate the testing/modification process and to release the software during the development phase. We present a Bayesian decision theoretic approach by formulating the optimal release problem as a sequential decision problem. By using a non‐Gaussian Kalman filter type model, proposed by Chen and Singpurwalla (1994), to track software reliability, we are able to obtain tractable expressions for inference and determine a one‐stage look ahead stopping rule under reasonable conditions and a class of loss functions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
278.
279.
贾玲 《中国人民武装警察部队学院学报》2009,25(3):86-87,90
实践表明,对影响VB程序设计课程教学中存在的突出问题进行认真分析,充分利用网络教学平台,改革课堂教学方法、抓好上机实践环节。此举有效地激发了学生的学习兴趣,提高学生的编程能力,同时也有助于提高教学质量和效果。 相似文献
280.
根据近年来装备保障的实践和国外的发展,从装备作战使用的角度辨析了装备保障的定义,界定了其范围,重点提出了装备保障性目标总要求,阐述了其内涵和任务能力的关系,简述了其确定过程及关键技术,基于装备任务能力与装备执行任务能力对装备保障性进行了系统分析。 相似文献