全文获取类型
收费全文 | 290篇 |
免费 | 16篇 |
出版年
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 9篇 |
2017年 | 5篇 |
2016年 | 11篇 |
2015年 | 9篇 |
2014年 | 6篇 |
2013年 | 69篇 |
2011年 | 6篇 |
2009年 | 3篇 |
2008年 | 5篇 |
2007年 | 4篇 |
2005年 | 4篇 |
2004年 | 5篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 6篇 |
1999年 | 8篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 9篇 |
1991年 | 8篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 8篇 |
1987年 | 5篇 |
1986年 | 5篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1979年 | 7篇 |
1978年 | 2篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 4篇 |
1973年 | 2篇 |
1972年 | 5篇 |
1971年 | 5篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1967年 | 4篇 |
1966年 | 5篇 |
排序方式: 共有306条查询结果,搜索用时 15 毫秒
241.
Two new randomization tests are introduced for ordinal contingency tables for testing independence against strictly positive quadrant dependence, i.e., P(X > x,Y > y) ≥ P(X > x)P(Y > y) for all x,y with strict inequality for some x and y. For a number of cases, simulation is used to compare the estimated power of these tests versus those standard tests based on Kendall's T, Spearman's p, Pearson's X2, the usual likelihood ratio test, and a test based upon the log-odds ratio. In these cases, subsets of the alternative region are identified where each of the testing statistics is superior. The new tests are found to be more powerful than the standard tests over a broad range of the alternative regions for these cases. 相似文献
242.
Given point-to-point demand forecasts of transmission facilities for services such as voice or data transmission in each period of a finite planning horizon, a decision has to be made as to which types of transmission facilities—together with the amounts of transmission circuits—are to be installed, if any, on each link of the telecommunications network, in each period of the planning horizon. The availability of alternative transmission systems with significantly different costs and circuit capacities necessitates the determination of a minimum (discounted) cost facility installation scheme. This combinatoric choice problem is complicated by the availability of switching equipments enabling the transmission of some of the traffic through intermediary points. This possibility of alternately routing the traffic or the facility requirements of certain point pairs further complicates the problem while creating the opportunity to benefit from economies of scale. We present here a heuristic method for finding a good solution for the general problem; namely, we consider multiple transmission systems and multiple alternate routes. Numerical examples are given and computational experience is reported. 相似文献
243.
Previous lot-sizing models incorporating learning effects focus exclusively on worker learning. We extend these models to include the presence of setup learning, which occurs when setup costs exhibit a learning curve effect as a function of the number of lots produced. The joint worker/setup learning problem can be solved to optimality by dynamic programming. Computational experience indicates, however, that solution times are sensitive to certain problem parameters, such as the planning horizon and/or the presence of a lower bound on worker learning. We define a two-phase EOQ-based heuristic for the problem when total transmission of worker learning occurs. Numerical results show that the heuristic consistently generates solutions well within 1% of optimality. 相似文献
244.
Steven T. Zech 《Defense & Security Analysis》2016,32(2):177-191
This study examines the unintended consequences of decapitation strategies. Two Islamist terror networks in Spain have been used to critically evaluate theories of leadership removal guided by large-N cross-sectional research. Arguably, current models neglect to include relational variables that constitute the foundation for policies of network disruption. Spanish terror networks are mapped out over a 10-year period (1995–2004) to demonstrate the importance of network variables. Policies meant to disrupt militant networks can generate unintended consequences, as was the case with Spain’s Operation Dátil following the 9/11 attacks on the Twin Towers and the Pentagon in the United States. The Madrid train bombing network developed in the vacant political space following the counterterrorism operation that targeted radical Islamists in Spain. 相似文献
245.
246.
Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost 下载免费PDF全文
Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016 相似文献
247.
A military cannot hope to improve in wartime if it cannot learn. Ideally, in wartime, formal learning ceases and the application of knowledge begins. But this is optimistic. In 1942, USAAF Eighth Air Force assumed it had the means necessary for victory. In reality, its technique and technology were only potentially – rather than actually – effective. What remained was to create the practice of daylight bombing – to learn. This article (1) recovers a wartime learning process that created new knowledge, (2) tests existing tacit hypotheses in military adaptation research, and (3) offers additional theoretical foundation to explain how knowledge is created in wartime 相似文献
248.
This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms. 相似文献
249.
250.