全文获取类型
收费全文 | 804篇 |
免费 | 230篇 |
国内免费 | 88篇 |
出版年
2024年 | 4篇 |
2023年 | 13篇 |
2022年 | 18篇 |
2021年 | 14篇 |
2020年 | 26篇 |
2019年 | 14篇 |
2018年 | 11篇 |
2017年 | 50篇 |
2016年 | 64篇 |
2015年 | 31篇 |
2014年 | 54篇 |
2013年 | 57篇 |
2012年 | 73篇 |
2011年 | 77篇 |
2010年 | 40篇 |
2009年 | 78篇 |
2008年 | 65篇 |
2007年 | 50篇 |
2006年 | 61篇 |
2005年 | 55篇 |
2004年 | 56篇 |
2003年 | 32篇 |
2002年 | 39篇 |
2001年 | 24篇 |
2000年 | 13篇 |
1999年 | 15篇 |
1998年 | 20篇 |
1997年 | 17篇 |
1996年 | 7篇 |
1995年 | 14篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 2篇 |
排序方式: 共有1122条查询结果,搜索用时 15 毫秒
341.
342.
The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature. 相似文献
343.
借助于抗扰物联网技术,科技产业能够实现精细化管理、高效化运作。借助现代科技,基于NFC实现抗扰物联网监测系统的研究与设计。虽然我国当前已经逐步构建抗扰物联网通信系统,但其存在着布线难、操作难、数据传输难等阻碍问题,而据分析近距离通信技术构成的两级农业监测信息物联通信方案能够有效解决当前阻碍。因而通过设计Zigbee自组织网络改善系统内的各个模块的数据无线传输;在系统中纳入NFC技术,达到整个系统整体同移动终端的近距离无线传输,针对数据传输在检测中出现的干扰性较强的问题,提出运用捕获算法(PMF-FFT)。该算法融合了部分匹配滤波器和FFT技术,能够实现通信干扰对消除并比传统系统更加节约能源消耗。最终对基于NFC的抗扰物联网监测系统通过实践操作进行了验证。 相似文献
344.
针对航空肼燃料保障安全评价的复杂性和非线性,提出并建立了基于BP和Hopfield神经网络的动态安全评价模型。在综合分析国内外肼燃料保障安全评价的基础上,针对航空肼燃料保障过程中出现的问题,构建并优化了指标体系,选取前馈神经网络中的BP网络和反馈神经网络中的Hopfield网络建立评价模型。在详细说明了BP和Hopfield神经网络的构建方法后,进行实例验证,并对预测效果进行了比较分析。仿真表明,两种模型都能正确评价安全保障状态。但在收敛速度、联想记忆功能方面Hopfield神经网络优于BP神经网络。将BP和Hopfield神经网络用于肼燃料保障安全评价过程中,具有适用性和可行性,对于航空肼燃料保障的安全建设与安全管理研究具有重要意义。 相似文献
345.
346.
347.
348.
In the literature two common macroscopic evacuation planning approaches exist: The dynamic network flow approach and the Cell–Transmission–Based approach. Both approaches have advantages and disadvantages. Many efficient solution approaches for the dynamic network flow approach exist so that realistic problem instances can be considered. However, the consideration of (more) realistic aspects (eg, density dependent travel times) results in non‐linear model formulations. The Cell‐Transmission‐Based approach on the other hand considers realistic traffic phenomena like shock waves and traffic congestion, but this approach leads to long computational times for realistic problem instances. In this article, we combine the advantages of both approaches: We consider a Cell‐Transmission‐Based Evacuation Planning Model (CTEPM) and present a network flow formulation that is equivalent to the cell‐based model. Thus, the computational costs of the CTEPM are enormously reduced due to the reformulation and the detailed representation of the traffic flow dynamics is maintained. We investigate the impacts of various evacuation scenario parameters on the evacuation performance and on the computational times in a computational study including 90 realistic instances. 相似文献
349.
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 相似文献
350.
针对雷达组网探测能力的评估问题,采用鱼骨图法对影响雷达组网探测能力的多种因素进行梳理,得到结构层次清晰的指标评价体系。采用改进的区间层次分析—控制区间和记忆模型对该指标体系进行评估,具体方法是:运用区间层次分析法构造区间判断矩阵;利用蛙跳算法求解区间判断矩阵中满足最小一致性的确定性矩阵;利用控制区间和记忆模型来确定各指标的风险概率,实现指标体系的评估。以具体的案例为对象进行仿真实验,结果表明,所提评估方法有效,评估结论相对客观、可信,对雷达组网探测能力评估具有一定参考价值,从而为雷达组网的优化部署奠定良好基础。 相似文献