全文获取类型
收费全文 | 423篇 |
免费 | 152篇 |
国内免费 | 30篇 |
出版年
2024年 | 3篇 |
2023年 | 5篇 |
2022年 | 2篇 |
2021年 | 9篇 |
2020年 | 8篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 23篇 |
2016年 | 25篇 |
2015年 | 19篇 |
2014年 | 30篇 |
2013年 | 30篇 |
2012年 | 29篇 |
2011年 | 44篇 |
2010年 | 26篇 |
2009年 | 40篇 |
2008年 | 19篇 |
2007年 | 36篇 |
2006年 | 26篇 |
2005年 | 26篇 |
2004年 | 32篇 |
2003年 | 13篇 |
2002年 | 19篇 |
2001年 | 18篇 |
2000年 | 20篇 |
1999年 | 23篇 |
1998年 | 11篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 7篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 1篇 |
1988年 | 2篇 |
排序方式: 共有605条查询结果,搜索用时 15 毫秒
481.
482.
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. 相似文献
483.
484.
改进相空间重构方法在混沌识别中的应用研究 总被引:3,自引:1,他引:2
讨论了传统非线性时间序列相空间重构方法的特点,提出了一种改进的相空间重构方法.为了揭示非线性时间序列中的非线性相关性,采用了一种基于关联积分的统计量,并研究了不同参数对它的影响.研究了延迟时间和嵌入维数之间的关系,并采用时间窗口描述这2个参数的变化规律.同时,应用改进方法计算了混沌时间序列的重构参数,重构了混沌信号的吸引子.研究结果表明,该方法能够从时间序列有效地重构原系统的相空间,为混沌信号识别提供了新的途径. 相似文献
485.
Benjamin Legros 《海军后勤学研究》2023,70(1):53-71
This study aims to determine and evaluate dynamic idling policies where an agent can idle while some customers remain waiting. This type of policies can be employed in situations where the flow of urgent customers does not allow the agent to spend sufficient time on back-office tasks. We model the system as a single-agent exponential queue with abandonment. The objective is to minimize the system's congestion while ensuring a certain proportion of idling time for the agent. Using a Markov decision process approach, we prove that the optimal policy is a threshold policy according to which the agent should idle above (below) a certain threshold on the queue length if the congestion-related performance measure is concave (convex) with respect to the number of customers present. We subsequently obtain the stationary probabilities, performance measures, and idling time duration, expressed using complex integrals. We show how these integrals can be numerically computed and provide simpler expressions for fast-agent and heavy-traffic asymptotic cases. In practice, the most common way to regulate congestion is to control access to the service by rejecting some customers upon arrival. Our analysis reveals that idling policies allow high levels of idling probability that such rejection policies cannot reach. Furthermore, the greatest benefit of implementing an optimal idling policy occurs when the objective occupation rate is close to 50% in highly congested situations. 相似文献
486.
对某型机械装备基层级修复性维修时间进行了统计分析,确定了维修时间的分布形式、分布参数及各种维修时间参数值。 相似文献
487.
随着序列情形费用型投资模型和折扣投资模型的解决,本文对其进行连续推广,并给出一个明确的停止规则。 相似文献
488.
本文讨论单输入单输出线性时变系统的逆系统问题,给出了可逆性的充要条件和两种降阶逆系统的计算方法,并用例子说明了这些方法。 相似文献
489.
大型复杂系统完成规定任务往往涉及多个阶段,并且在不同的任务阶段,系统通常由其各级子系统、单元以不同的功能组合形式构成,因而,其可靠性逻辑结构(框图)也随时间的改变而改变。当连续多阶段系统不能分阶段单独处理时,将引出所谓的时段延续相关性问题。本文重点研究了时变结构多阶段任务系统的时段延续相关性问题,对典型时变结构的可靠度进行了分析,提出了有效的解决方法并建立了相应的数学模型。研究成果已应用于某大型测控系统的可靠性分析任务中 相似文献
490.
This paper develops a panel smooth transition vector autoregressive model to investigate the economic growth–defense causality. This model simultaneously resolves the estimation problems of endogeneity, heterogeneity, and nonlinearity. Empirical results support that the causality is bidirectional, nonlinear, time- and country-varying. Economic growth has a negative impact on military spending and vice versa. The larger the HDI, the smaller the negative causality. Evidently, the increase in the level of country development can reduce the negative impact of military outlays on economic growth. Reducing the ratio of military spending to GDP is beneficial for countries with low HDI scores; however, moderately increasing the share of military expenditure is favorable for countries with extremely high HDI scores. Policy authority needs to set optimal education, health, and economic development shares of GDP for purchasing a maximum economic growth rate. 相似文献