全文获取类型
收费全文 | 1186篇 |
免费 | 505篇 |
国内免费 | 121篇 |
出版年
2024年 | 6篇 |
2023年 | 12篇 |
2022年 | 17篇 |
2021年 | 24篇 |
2020年 | 23篇 |
2019年 | 27篇 |
2018年 | 30篇 |
2017年 | 54篇 |
2016年 | 84篇 |
2015年 | 75篇 |
2014年 | 98篇 |
2013年 | 75篇 |
2012年 | 93篇 |
2011年 | 89篇 |
2010年 | 75篇 |
2009年 | 114篇 |
2008年 | 80篇 |
2007年 | 92篇 |
2006年 | 103篇 |
2005年 | 80篇 |
2004年 | 83篇 |
2003年 | 55篇 |
2002年 | 57篇 |
2001年 | 56篇 |
2000年 | 42篇 |
1999年 | 42篇 |
1998年 | 36篇 |
1997年 | 37篇 |
1996年 | 29篇 |
1995年 | 12篇 |
1994年 | 21篇 |
1993年 | 20篇 |
1992年 | 22篇 |
1991年 | 16篇 |
1990年 | 20篇 |
1989年 | 10篇 |
1988年 | 3篇 |
排序方式: 共有1812条查询结果,搜索用时 15 毫秒
971.
本文讨论了在大规模并行计算机上实现数据并行程序设计语言的关键问题──分布数组的地址计算问题。文中详细给出了维分布数组的下标地址计算公式,分布数组的内情向量结构以及分布数组映射函数算法,并对有关编译实现技术进行了探讨。 相似文献
972.
973.
974.
张金槐 《国防科技大学学报》2001,23(3):93-97
为了合理运用多种验前信息 ,文中首先引入了验前信息的可信度的概念 ,由此论述了验前信息与现场试验信息的融合方法 ,给出了多源信息下的Bayes精度鉴定方案。最后以实例说明鉴定方案的运用。 相似文献
975.
976.
The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001 相似文献
977.
We study a workforce planning and scheduling problem in which weekly tours of agents must be designed. Our motivation for this study comes from a call center application where agents serve customers in response to incoming phone calls. Similar to many other applications in the services industry, the demand for service in call centers varies significantly within a day and among days of the week. In our model, a weekly tour of an agent consists of five daily shifts and two days off, where daily shifts within a tour may be different from each other. The starting times of any two consecutive shifts, however, may not differ by more than a specified bound. Furthermore, a tour must also satisfy constraints regarding the days off, for example, it may be required that one of the days off is on a weekend day. The objective is to determine a collection of weekly tours that satisfy the demand for agents' services, while minimizing the total labor cost of the workforce. We describe an integer programming model where a weekly tour is obtained by combining seven daily shift scheduling models and days‐off constraints in a network flow framework. The model is flexible and can accommodate different daily models with varying levels of detail. It readily handles different days‐off rules and constraints regarding start time differentials in consecutive days. Computational results are also presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 607–624, 2001. 相似文献
978.
In modern warfare, many believe the decisive factor in winning a battle is seizing the right moment to shift from defense to attack, or vice versa. This paper attempts to bring that perspective to Lanchester's differential equations of warfare, and continues the application of Lanchester's linear law to the analysis of the World War II battle of Ardennes, as reported in earlier issues of Naval Research Logistics by Bracken and by Fricker. A new variable, shift time, accounting for the timing of the shift between defense and attack is explicitly included in our version of the model, and it helps obtain improved goodness of fit to historical data. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:653–661, 2001 相似文献
979.
We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001 相似文献
980.
A mathematical model of portfolio optimization is usually represented as a bicriteria optimization problem where a reasonable tradeoff between expected rate of return and risk is sought. In a classical Markowitz model, the risk is measured by a variance, thus resulting in a quadratic programming model. As an alternative, the MAD model was developed by Konno and Yamazaki, where risk is measured by (mean) absolute deviation instead of a variance. The MAD model is computationally attractive, since it is easily transformed into a linear programming problem. An extension to the MAD model proposed in this paper allows us to measure risk using downside deviations, with the ability to penalize larger downside deviations. Hence, it provides for better modeling of risk averse preferences. The resulting m‐MAD model generates efficient solutions with respect to second degree stochastic dominance, while at the same time preserving the simplicity and linearity of the original MAD model. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 185–200, 2001 相似文献