全文获取类型
收费全文 | 489篇 |
免费 | 230篇 |
国内免费 | 62篇 |
专业分类
781篇 |
出版年
2024年 | 6篇 |
2023年 | 9篇 |
2022年 | 12篇 |
2021年 | 12篇 |
2020年 | 18篇 |
2019年 | 18篇 |
2018年 | 14篇 |
2017年 | 44篇 |
2016年 | 51篇 |
2015年 | 30篇 |
2014年 | 55篇 |
2013年 | 31篇 |
2012年 | 55篇 |
2011年 | 47篇 |
2010年 | 33篇 |
2009年 | 52篇 |
2008年 | 30篇 |
2007年 | 33篇 |
2006年 | 57篇 |
2005年 | 36篇 |
2004年 | 26篇 |
2003年 | 19篇 |
2002年 | 16篇 |
2001年 | 10篇 |
2000年 | 6篇 |
1999年 | 10篇 |
1998年 | 7篇 |
1997年 | 1篇 |
1996年 | 5篇 |
1995年 | 8篇 |
1994年 | 5篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 6篇 |
排序方式: 共有781条查询结果,搜索用时 15 毫秒
151.
152.
针对信息化武器装备体系复杂系统的结构优化问题,以综合集成思想和复杂自适应系统理论为指导,提出探索性计算实验优化方法和面向探索性计算实验的SABI(System of system,Agent,Behavior,Interaction)建模方法。在分析武器装备体系结构优化目标的基础上,依据武器装备体系探索性计算实验自顶向下的探索分析和自底向上的综合集成分析的要求,给出了武器装备体系结构探索性计算实验优化分析逻辑框架和基于多Agent的武器装备体系探索性计算实验优化分析模型。 相似文献
153.
154.
In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time. Most of this work has focused on makespan minimization as social objective. In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics. In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time; and each machine sequences its jobs in weighted shortest processing time (WSPT) order. Whereas for the makespan social cost the price of anarchy is not bounded by a constant in most environments, we show that for our minsum social objective the price of anarchy is bounded above by a small constant, independent of the instance. Specifically, we show that the price of anarchy is exactly 2 for the class of unit jobs, unit speed instances where the finite processing time values define the edge set of a forest with the machines as nodes. For the general case of mixed job strategies and restricted uniform machines, we prove that the price of anarchy equals 4. From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
155.
人工神经网络特征优化方法在模式识别中的应用 总被引:1,自引:0,他引:1
在模式识别中,特征量的选择及组合优化是设计模式识别系统的关键问题,它强烈地影响到分类器的设计及其性能。人工神经网络除了在模式识别中作为分类器应用之外,而且能够实现特征参数的提取。通过采用人工神经网络模型,对柴油机故障的特征量优化方法进行了研究,实现了对柴油机故障的特征提取及优化。 相似文献
156.
Tobias Brueggemann Johann L. Hurink Tjark Vredeveld Gerhard J. Woeginger 《海军后勤学研究》2011,58(8):795-803
We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
157.
158.
The idea of deploying noncollocated sources and receivers in multistatic sonar networks (MSNs) has emerged as a promising area of opportunity in sonar systems. This article is one of the first to address point coverage problems in MSNs, where a number of points of interest have to be monitored in order to protect them from hostile underwater assets. We consider discrete “definite range” sensors as well as various diffuse sensor models. We make several new contributions. By showing that the convex hull spanned by the targets is guaranteed to contain optimal sensor positions, we are able to limit the solution space. Under a definite range sensor model, we are able to exclude even more suboptimal solutions. We then formulate a nonlinear program and an integer nonlinear program to express the sensor placement problem. To address the nonconvex single‐source placement problem, we develop the Divide Best Sector (DiBS) algorithm, which quickly provides an optimal source position assuming fixed receivers. Starting with a basic implementation of DiBS, we show how incorporating advanced sector splitting methods and termination conditions further improve the algorithm. We also discuss two ways to use DiBS to find multiple source positions by placing sensors iteratively or simultaneously. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 287–304, 2017 相似文献
159.
A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λi. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λi's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051 相似文献
160.
韩志英 《中国人民武装警察部队学院学报》2010,26(3):15-18
边防情报在公安边防部门开展对敌斗争,维护沿边沿海地区政治、社会稳定和预防打击犯罪中发挥着越来越重要的作用。对边防情报进行科学管理,更好地发挥边防情报的服务功能,需要对边防情报资源管理模式进行优化。引入知识管理模式,以期实现边防情报资源管理模式的优化。 相似文献