全文获取类型
| 收费全文 | 919篇 |
| 免费 | 43篇 |
| 国内免费 | 8篇 |
专业分类
| 970篇 |
出版年
| 2025年 | 6篇 |
| 2024年 | 9篇 |
| 2023年 | 17篇 |
| 2022年 | 10篇 |
| 2021年 | 11篇 |
| 2020年 | 21篇 |
| 2019年 | 20篇 |
| 2018年 | 17篇 |
| 2017年 | 52篇 |
| 2016年 | 60篇 |
| 2015年 | 41篇 |
| 2014年 | 50篇 |
| 2013年 | 52篇 |
| 2012年 | 53篇 |
| 2011年 | 52篇 |
| 2010年 | 43篇 |
| 2009年 | 52篇 |
| 2008年 | 32篇 |
| 2007年 | 43篇 |
| 2006年 | 50篇 |
| 2005年 | 36篇 |
| 2004年 | 34篇 |
| 2003年 | 22篇 |
| 2002年 | 21篇 |
| 2001年 | 26篇 |
| 2000年 | 20篇 |
| 1999年 | 16篇 |
| 1998年 | 9篇 |
| 1997年 | 19篇 |
| 1996年 | 13篇 |
| 1995年 | 10篇 |
| 1994年 | 15篇 |
| 1993年 | 13篇 |
| 1992年 | 10篇 |
| 1991年 | 10篇 |
| 1990年 | 3篇 |
| 1989年 | 1篇 |
| 1987年 | 1篇 |
排序方式： 共有970条查询结果，搜索用时 0 毫秒
481.
482.
针对传统的电磁环境建模方法难以准确地描述电磁环境动态变化的问题,提出了一种基于Multi-Agent技术的动态电磁环境建模方法。首先分析了电磁环境建模的层次结构;然后建立了通信电台、雷达、侦察站、干扰站的Agent实体模型,建立了Agent行动模型和Multi-Agent系统交互模型,解决了个体Agent模型设计中的感知、动作、决策及实现方法上的问题。最后设置某仿真场景,利用Netlogo仿真平台建立仿真验证系统,仿真结果验证了模型的有效性,表明了应用Multi-Agent建模方法解决电磁环境的动态模拟的可行性。 相似文献
483.
Assemble‐to‐order (ATO) is an important operational strategy for manufacturing firms to achieve quick response to customer orders while keeping low finished good inventories. This strategy has been successfully used not only by manufacturers (e.g., Dell, IBM) but also by retailers (e.g., Amazon.com). The evaluation of order‐based performance is known to be an important but difficult task, and the existing literature has been mainly focused on stochastic comparison to obtain performance bounds. In this article, we develop an extremely simple Stein–Chen approximation as well as its error‐bound for order‐based fill rate for a multiproduct multicomponent ATO system with random leadtimes to replenish components. This approximation gives an expression for order‐based fill rate in terms of component‐based fill rates. The approximation has the property that the higher the component replenishment leadtime variability, the smaller the error bound. The result allows an operations manager to analyze the improvement in order‐based fill rates when the base‐stock level for any component changes. Numerical studies demonstrate that the approximation performs well, especially when the demand processes of different components are highly correlated; when the components have high base‐stock levels; or when the component replenishment leadtimes have high variability. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
484.
485.
水面舰艇使用助飞鱼雷攻潜时,可以利用舰载声纳系统或舰载直升机吊放声纳系统分别对目标潜艇进行定位并引导舰艇攻击潜艇,本文建立了这两种目标定位方法的散布误差模型,并在仿真计算的基础上,比较分析了两种定位引导方法目标散布误差的优劣,为助飞鱼雷攻潜指挥决策提供了依据,对提高助飞鱼雷作战效能具有指导意义。 相似文献
486.
487.
在靶场对武器装备的试验鉴定中,必须进行试验设计,目标和目标航路参数是试验参数设计中重点考虑的内容之一,目标航路捷径的波动则直接影响试验参数设计和考核结论。通过分析武器装备中雷达误差来源,找出目标航路捷径波动与雷达误差之间的函数关系,并计算推导出航路捷径允许波动范围的数学模型;以靶场试验实例给出了航路捷径波动确定的基本原则,为靶场试验设计提供有价值的参考方法。 相似文献
488.
Dimitrios G. Pandelis 《海军后勤学研究》2014,61(6):435-446
We consider two‐stage tandem queueing systems with dedicated servers in each station and a flexible server that is trained to serve both stations. We assume no arrivals, exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming a noncollaborative work discipline with idling and preemptions allowed. For larger holding costs in the first station, we show that (i) nonidling policies are optimal and (ii) if the flexible server is not faster than the dedicated servers, the optimal server allocation strategy has a threshold‐type structure. For all other cases, we provide numerical results that support the optimality of threshold‐type policies. Our numerical experiments also indicate that when the flexible server is faster than the dedicated server of the second station, the optimal policy may have counterintuitive properties, which is not the case when a collaborative service discipline is assumed. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 435–446, 2014 相似文献
489.
Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014 相似文献
490.
In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010 相似文献