全文获取类型
收费全文 | 515篇 |
免费 | 325篇 |
国内免费 | 54篇 |
出版年
2024年 | 2篇 |
2023年 | 7篇 |
2022年 | 11篇 |
2021年 | 14篇 |
2020年 | 15篇 |
2019年 | 8篇 |
2018年 | 9篇 |
2017年 | 33篇 |
2016年 | 40篇 |
2015年 | 41篇 |
2014年 | 56篇 |
2013年 | 62篇 |
2012年 | 47篇 |
2011年 | 49篇 |
2010年 | 39篇 |
2009年 | 35篇 |
2008年 | 38篇 |
2007年 | 45篇 |
2006年 | 42篇 |
2005年 | 31篇 |
2004年 | 45篇 |
2003年 | 26篇 |
2002年 | 27篇 |
2001年 | 27篇 |
2000年 | 21篇 |
1999年 | 23篇 |
1998年 | 19篇 |
1997年 | 16篇 |
1996年 | 10篇 |
1995年 | 8篇 |
1994年 | 11篇 |
1993年 | 7篇 |
1992年 | 9篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 8篇 |
1988年 | 1篇 |
1987年 | 1篇 |
排序方式: 共有894条查询结果,搜索用时 15 毫秒
671.
Motivated by challenges in the smartphone manufacturing industry, we develop a dynamic production ramp-up model that can be applied to economically satisfy nonstationary demand for short-life-cycle products by high-tech companies. Due to shorter life cycles and more rapid evolution of smartphones, production ramp-up has been increasingly critical to the success of a new smartphone. In the production ramp-up, the key challenge is to match the increasing capacity to nonstationary demand. The high-tech smartphone manufacturers are urged to jointly consider the effect of increasing capacity and decreasing demand. We study the production planning problem using a high-dimensional Markov decision process (MDP) model to characterize the production ramp-up. To address the curse of dimensionality, we refine Monte Carlo tree search (MCTS) algorithm and theoretically analyze its convergence and computational complexity. In a real case study, we find that the MDP model achieves revenue improvement by stopping producing the existing product earlier than the benchmark policy. In synthetic instances, we validate that the proposed MCTS algorithm saves computation time without loss of solution quality compared with traditional value iteration algorithm. As part of the Lenovo production solution, our MDP model enables high-tech smartphone manufacturers to better plan the production ramp-up. 相似文献
672.
对计算流体力学(CFD)程序CNS提出一种Offload模式下基于内外子区域划分的异构并行算法,结合结构化网格下有限差分计算和四阶龙格库塔方法的特点,引入ghost网格点区域,设计了一种ghost区域收缩计算策略,显著降低了异构计算资源之间的数据传输开销,负载均衡时CPU端的计算与MPI通信完全和加速器端的计算重叠,提高了异构协同并行性。推导了保证计算正确性的ghost区域的参数,分析了负载均衡的条件。在“CPU(Intel Haswell Xeon E5-2670 12 cores ×2)+加速器(Xeon Phi 7120A ×2)”的服务器上测得该算法较直接将任务子块整体迁至加速器端计算的异构算法性能平均提升5.9倍,较MPI/OpenMP两级并行算法使用24个纯CPU核的性能,该算法使用单加速器时加速1.27倍,使用双加速器加速1.45倍。讨论和分析了性能瓶颈与存在的问题。 相似文献
673.
多个海洋环境监测系统之间存在的功能冗余导致资源浪费和不必要的资金投入,因此应将各个系统优化融合成有机整体来节约海洋环境监测的资源和成本。将海洋环境监测系统按照功能划分为不同的模块,在线性规划融合的基础上引入熵方法,以成本和效能指标为主要对象,通过合理分配,在确保系统优化融合后监测能力不降低的同时,尽量减少建设成本。 相似文献
674.
Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems. 相似文献
675.
针对结构可靠性分析问题,提出了Kriging与改进一次二阶矩方法相融合的分析方法。传统的改进一次二阶矩需要计算结构功能函数的梯度信息,在处理包含有限元模型的隐式极限状态问题时会比较困难。该方法将Kriging代理模型与改进一次二阶矩迭代有效而充分地结合,借助Kriging方法提供功能函数的梯度信息,以解决隐式极限状态函数的求导难题,提高分析效率。通过数值与工程算例验证了所提方法的可行性和高效性。 相似文献
676.
We study an (R, s, S) inventory control policy with stochastic demand, lost sales, zero lead‐time and a target service level to be satisfied. The system is modeled as a discrete time Markov chain for which we present a novel approach to derive exact closed‐form solutions for the limiting distribution of the on‐hand inventory level at the end of a review period, given the reorder level (s) and order‐up‐to level (S). We then establish a relationship between the limiting distributions for adjacent values of the reorder point that is used in an efficient recursive algorithm to determine the optimal parameter values of the (R, s, S) replenishment policy. The algorithm is easy to implement and entails less effort than solving the steady‐state equations for the corresponding Markov model. Point‐of‐use hospital inventory systems share the essential characteristics of the inventory system we model, and a case study using real data from such a system shows that with our approach, optimal policies with significant savings in inventory management effort are easily obtained for a large family of items. 相似文献
677.
We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
678.
We extend the noncooperative game associated with the cost spanning tree problem introduced by Bergantiños and Lorenzo (Math Method Oper Res 59(2004), 393–403) to situations where agents have budget restrictions. We study the Nash equilibria, subgame perfect Nash equilibria, and strong Nash equilibria of this game. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
679.
热压多晶氟化镁是一种被广泛应用的红外光学材料.磁流变抛光因其抛光效率高、磨头无磨损、可实现确定性加工等优点而日益成为倍受瞩目的超精密光整加工技术.在利用传统抛光方法得到热压多晶氟化镁的抛光特性的基础上配制了适用于该材料的磁流变抛光液.通过抛光实验证明,与传统抛光方法相比,采用磁流变抛光方法对热压多晶氟化镁进行抛光,可以得到较好抛光表面质量,并且抛光的效率也大大提高. 相似文献
680.
为了满足JPEG2000遥感图像实时压缩设备的实时性要求,提出了一种基于并行机制的“零时间”数据搬移策略。通过对EBC算法结构进行拆分,并采用EDMA方式进行数据搬移,使得算法运算与数据搬移过程完全并行,搬移时间等效为零。实验结果表明,采用新的数据搬移策略后,编码效率可以提升到100%,EBC算法实现的总时间可缩短46%以上。该搬移机制已成功应用于JPEG2000星载遥感图像实时压缩系统中,系统的实时性达到了设计要求。 相似文献