全文获取类型
| 收费全文 | 223篇 |
| 免费 | 8篇 |
| 国内免费 | 2篇 |
专业分类
| 233篇 |
出版年
| 2025年 | 2篇 |
| 2024年 | 1篇 |
| 2023年 | 4篇 |
| 2022年 | 2篇 |
| 2021年 | 1篇 |
| 2020年 | 4篇 |
| 2019年 | 3篇 |
| 2018年 | 8篇 |
| 2017年 | 11篇 |
| 2016年 | 15篇 |
| 2015年 | 8篇 |
| 2014年 | 13篇 |
| 2013年 | 12篇 |
| 2012年 | 10篇 |
| 2011年 | 13篇 |
| 2010年 | 13篇 |
| 2009年 | 16篇 |
| 2008年 | 13篇 |
| 2007年 | 12篇 |
| 2006年 | 8篇 |
| 2005年 | 8篇 |
| 2004年 | 12篇 |
| 2003年 | 3篇 |
| 2002年 | 4篇 |
| 2001年 | 4篇 |
| 2000年 | 3篇 |
| 1999年 | 2篇 |
| 1998年 | 8篇 |
| 1997年 | 3篇 |
| 1996年 | 2篇 |
| 1995年 | 2篇 |
| 1994年 | 2篇 |
| 1993年 | 4篇 |
| 1992年 | 3篇 |
| 1991年 | 1篇 |
| 1990年 | 3篇 |
排序方式： 共有233条查询结果，搜索用时 0 毫秒
181.
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. 相似文献
182.
This paper investigates the determinants of provincial terrorism in Turkey taking spatial dimension into account for the time period 1990–2006. Following a traditional global regression analysis, spatial variations in the relationships are examined with geographically weighted regression (GWR) to obtain locally different parameter estimates. Empirical results indicate that increases in income and schooling ratio tend to reduce the provincial average level of terrorism, whereas an increase in unemployment enhances it. Moreover, GWR results indicate that the provincial effects of per capita income and education are more pronounced for the Eastern and South Eastern provinces compared to the Western provinces. 相似文献
183.
We investigate the link between economic performance and terrorism for 18 Latin American countries from 1970 to 2007, taking into account the potentially complex nature of this link. Panel causality analysis findings indicate that during this period, terrorism had no causal effect on economic growth. By contrast, we find that growth reduced terrorism in the less developed but not in the higher developed Latin American economies. We argue that group-specific differences (linked to patterns of economic development) govern this causal heterogeneity. From a series of negative binomial regressions we gain additional support for our findings, while also identifying further determinants of terrorism. 相似文献
184.
在无线传感器网络（WSN）定位应用中,针对接收信号强度指示（RSSI）容易受到环境的影响不能实现准确测距的问题,提出了一种基于RSSI线性回归分析的定位方法。该方法通过信号衰减模型和线性回归理论相结合,修正实际环境下每个锚节点的测距模型,同时利用相关系数和剩余标准差对测距模型进行评估,制定出更加合理的定位策略。实验表明,采用修正的测距模型和新的定位策略,使得节点定位精度明显提高。 相似文献
185.
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献
186.
We consider two regression models: linear and logistic. The dependent variable is observed periodically and in each period a Bayesian formulation is used to generate updated forecasts of the dependent variable as new data is observed. One would expect that including new data in the Bayesian updates results in improved forecasts over not including the new data. Our findings indicate that this is not always true. We show there exists a subset of the independent variable space that we call the “region of no learning.” If the independent variable values for a given period in the future are in this region, then the forecast does not change with any new data. Moreover, if the independent variable values are in a neighborhood of the region of no learning, then there may be little benefit to wait for the new data and update the forecast. We propose a statistical approach to characterize this neighborhood which we call the “region of little learning.” Our results provide insights into the trade‐offs that exist in situations when the decision maker has an incentive to make an early decision based on an early forecast versus waiting to make a later decision based on an updated forecast. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 532–548, 2014 相似文献
187.
188.
In this article, we study a class of new scheduling models where time slot costs have to be taken into consideration. In such models, processing a job will incur certain cost which is determined by the time slots occupied by the job in a schedule. The models apply when operational costs vary over time. The objective of the scheduling models is to minimize the total time slot costs plus a traditional scheduling performance measure. We consider the following performance measures: total completion time, maximum lateness/tardiness, total weighted number of tardy jobs, and total tardiness. We prove the intractability of the models under general parameters and provide polynomial‐time algorithms for special cases with non‐increasing time slot costs.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
189.
We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
190.
Andrew Phiri 《Defence and Peace Economics》2019,30(4):474-487
Using annual data collected from 1988 to 2015, this study provides evidence of a non-linear relationship between military spending, economic growth and other growth determinants for the South African economy. The empirical study is based on estimates of a logistic smooth transition regression (LSTR) model and our empirical results point to an inverted U-shaped relationship between military spending and economic growth for the data. Furthermore, our empirical results suggest that the current levels of military spending, as a component of total government expenditure, are too high in the South African economy and need to be transferred towards more productive non-military expenditure in order to improve the performance of economic growth and other growth determinants. 相似文献