全文获取类型
收费全文 | 476篇 |
免费 | 8篇 |
专业分类
484篇 |
出版年
2021年 | 7篇 |
2019年 | 12篇 |
2018年 | 6篇 |
2017年 | 9篇 |
2016年 | 8篇 |
2015年 | 3篇 |
2014年 | 9篇 |
2013年 | 99篇 |
2012年 | 4篇 |
2010年 | 3篇 |
2009年 | 5篇 |
2007年 | 13篇 |
2004年 | 3篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 3篇 |
2000年 | 5篇 |
1999年 | 3篇 |
1998年 | 10篇 |
1997年 | 9篇 |
1996年 | 11篇 |
1995年 | 5篇 |
1994年 | 7篇 |
1993年 | 12篇 |
1992年 | 10篇 |
1991年 | 9篇 |
1990年 | 11篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 9篇 |
1986年 | 15篇 |
1985年 | 9篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 11篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1978年 | 9篇 |
1977年 | 6篇 |
1976年 | 6篇 |
1975年 | 4篇 |
1974年 | 8篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1971年 | 8篇 |
1970年 | 7篇 |
1969年 | 6篇 |
1967年 | 9篇 |
1948年 | 4篇 |
排序方式: 共有484条查询结果,搜索用时 0 毫秒
1.
This article shows how simple systems of linear equations with {0,1} variables can be aggregated into a single linear equation whose {0,1} solutions are identical to the solutions of the original system. Structures of the original systems are exploited to keep the aggregator's integer coefficients from becoming unnecessarily large. The results have potential application in integer programming and information theory, especially for problems that contain assignment-type constraints along with other constraints. Several unresolved questions of a number-theoretic nature are mentioned at the conclusion of the article. 相似文献
2.
In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas. 相似文献
3.
R. D. Wollmer 《海军后勤学研究》1970,17(2):207-216
This paper presents an algorithm for determining where to place intercepting units in order to maximize the probability of preventing an opposing force from proceeding from one particular node in an undirected network to another. The usual gaming assumptions are invoked; namely, the strategy for placing the units is known to the opponent and he will choose a path through the network which, based on this knowledge, maximizes his probability of successful traverse. As given quantities, the model requires a list of the arcs and nodes of the network, the number of intercepting units available to stop the opposing force, and the probabilities for stopping the opposition at the arcs and nodes as functions of the number of intercepting units placed there. From these quantities, the algorithm calculates the probabilities for placing the unit at the arcs and nodes when one intercepting unit is available, and the expected numbers of units to place at the arcs and nodes when multiple intercepting units are available. 相似文献
4.
5.
In this article, we are concerned with scheduling stochastic jobs in a flowshop with m machines and zero intermediate storage. We assume that there are n - 2 identically distributed and 2 fast stochastic jobs. Roughly, the main result states that the makespan is stochastically minimized by placing one of the fast jobs first and the other last. 相似文献
6.
This paper presents a general solution for the M/M/r queue with instantaneous jockeying and r > 1 servers. The solution is obtained in matrices in closed form without recourse to the generating function arguments usually used. The solution requires the inversion of two (Zr?1) × (2r?1) matrices. The method proposed is extended to allow different queue selection preferences of arriving customers, balking of arrivals, jockeying preference rules, and queue dependent selection along with jockeying. To illustrate the results, a problem previously published is studied to show how known results are obtained from the proposed general solution. 相似文献
7.
Mathematical models of tactical problems in Hntisubmarine Warfare (ASW) are developed. Specifically, a game of pursuit between a hunter-killer force. player 1, and a possible submarine, player 2 is considered. The game consists of a sequence of moves and terminates when player 2 is tcaught or evades player 1. When the players move they observe the actual tactical configuration of the forces (state) and each player choosa-s a tactical plan from a finite collection. This joint choice of tactical plans determines an immediate payoff and a transition probability distribution over the states. Hence an expected payoff function is defined, Formally this game is a Terminating Stochastic Game (TSG). Shapley demonstrated the existence of a value and optimal strategies (solution), An iterative technique to approximate the solution to within desired accuracy is proposed. Each iteration of the technique is obtained by solving a set of linear programs. To introduce more realism into the game several variations of the TSG are also considered. One variation is a finite TSG and linear programming techniques are employed to find the solution. 相似文献
8.
This article is concerned with the optimal location of any number (n) of facilities in relation to any number (m) of destinations on the Euclidean plane. The criterion to be satisfied is the minimization of total weighted distances where the distances are rectangular. The destinations may be either single points, lines or rectangular areas. A gradient reduction solution procedure is described which has the property that the direction of descent is determined by the geometrical properties of the problem. 相似文献
9.
A Student's t-test proposed by Ogawa is considered for the hypothesis Ho: σ=σo against the alternative hypothesis H1: σ ≠ σo, where σ is the scale parameter of the Extremevalue distribution of smallest values with known location parameter μ. The test is based on a few sample quantiles chosen from a large sample so as to give asymptotically maximum power to the test when the number of sample quantiles is fixed. A table which facilitates the computation of the test statistic is given. Several schemes for determining the ranks of the sample quantiles by the optimal spacings are compared and the effect of the bias of the estimate of σ on the test is investigated through a Monte Carlo study. 相似文献
10.
William R. Patterson 《Low Intensity Conflict & Law Enforcement》2002,11(1):77-93
Since the end of the Cold War the process of nation building has become a priority in the attempt to maintain world order and security in the wake of the instability and devastation wrought by failed and war-torn states. The proliferation of nation-building missions has led to their diversification and the need to marshal a vast array of resources in order to attain substantial levels of success. This article deals with a new and important component of peacekeeping and nation-building missions, that of civilian policing. The article outlines the goals of using civilian police officers in nation-building missions and discusses a variety of problems (pragmatic, legal, and cultural) that policing may introduce to such missions. This discussion is focused around the civilian policing component of the United Nations Mission in Kosovo. It delineates the successes and hardships so far experienced during the mission in Kosovo and explores the insights that the mission may provide for similar projects in the future. 相似文献