全文获取类型
收费全文 | 1676篇 |
免费 | 116篇 |
国内免费 | 126篇 |
专业分类
化学 | 5篇 |
晶体学 | 1篇 |
力学 | 2篇 |
综合类 | 22篇 |
数学 | 465篇 |
物理学 | 101篇 |
综合类 | 1322篇 |
出版年
2024年 | 7篇 |
2023年 | 14篇 |
2022年 | 26篇 |
2021年 | 32篇 |
2020年 | 14篇 |
2019年 | 28篇 |
2018年 | 26篇 |
2017年 | 47篇 |
2016年 | 36篇 |
2015年 | 57篇 |
2014年 | 101篇 |
2013年 | 130篇 |
2012年 | 109篇 |
2011年 | 117篇 |
2010年 | 97篇 |
2009年 | 133篇 |
2008年 | 119篇 |
2007年 | 180篇 |
2006年 | 132篇 |
2005年 | 100篇 |
2004年 | 100篇 |
2003年 | 84篇 |
2002年 | 42篇 |
2001年 | 42篇 |
2000年 | 31篇 |
1999年 | 21篇 |
1998年 | 12篇 |
1997年 | 9篇 |
1996年 | 13篇 |
1995年 | 11篇 |
1994年 | 7篇 |
1993年 | 9篇 |
1992年 | 8篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1985年 | 5篇 |
1982年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有1918条查询结果,搜索用时 15 毫秒
891.
Jan Fabian Ehmke Ann Melissa Campbell Timothy L. Urban 《European Journal of Operational Research》2015
In the stochastic variant of the vehicle routing problem with time windows, known as the SVRPTW, travel times are assumed to be stochastic. In our chance-constrained approach to the problem, restrictions are placed on the probability that individual time window constraints are violated, while the objective remains based on traditional routing costs. In this paper, we propose a way to offer this probability, or service level, for all customers. Our approach carefully considers how to compute the start-service time and arrival time distributions for each customer. These distributions are used to create a feasibility check that can be “plugged” into any algorithm for the VRPTW and thus be used to solve large problems fairly quickly. Our computational experiments show how the solutions change for some well-known data sets across different levels of customer service, two travel time distributions, and several parameter settings. 相似文献
892.
We develop methods to estimate and exactly calculate the expected cost of a priori policies for the multi-compartment vehicle routing problem with stochastic demands, an extension of the classical vehicle routing problem where customer demands are uncertain and products must be transported in separate partitions. We incorporate our estimation procedure into a cyclic-order-based simulated annealing algorithm, significantly improving the best-known solution values for a set of benchmark problems. We also extend the updating procedure for a cyclic order’s candidate route set to duration-constrained a priori policies. 相似文献
893.
Dominique Tschopp Suhas Diggavi Matthias Grossglauser 《Random Structures and Algorithms》2015,47(4):669-709
The topology of a mobile wireless network changes over time. Maintaining routes between all nodes requires the continuous transmission of control information, which consumes precious power and bandwidth resources. Many routing protocols have been developed, trading off control overhead and route quality. In this paper, we ask whether there exist low‐overhead schemes that produce low‐stretch routes, even in large networks where all the nodes are mobile. We present a scheme that maintains a hierarchical structure within which constant‐stretch routes can be efficiently computed between every pair of nodes. The scheme rebuilds each level of the hierarchy periodically, at a rate that decreases exponentially with the level of the hierarchy. We prove that this scheme achieves constant stretch under a mild smoothness condition on the nodal mobility processes. Furthermore, we prove tight bounds for the network‐wide control overhead under the additional assumption of the connectivity graph forming a doubling metric space. Specifically, we show that for a connectivity model combining the random geometric graph with obstacles, constant‐stretch routes can be maintained with a total overhead of bits of control information per time unit. © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 47, 669–709, 2015 相似文献
894.
Jichao Zhang Jiyu Liu Guansong Wang Liu Huang Faze Chen 《Journal of Dispersion Science and Technology》2013,34(11):1627-1636
Oil/water separation has attracted more attention with the dramatic increasing of oil spill accidents and arbitrarily discharged oily industrial water. However, many reported materials with controllable wettability for on-demand oil/water separation of both heavy and light oil/water mixtures involve complicated devices and dangerous fabrication processes. Herein, we propose a simple, environmentally friendly and high-efficient method to fabricate Al mesh with controllable wettability. Heavy oil can be separated with a high efficiency of 99% in oil-removing mode. For light oil, the separation efficiency can also reach up to 99% in water-removing mode. Additionally, surface wettability of the mesh can be conversed from superhydrophobicity to superhydrophilicity by atmospheric pressure plasma jet (APPJ) and heating, thereby realizing continuous bidirectional separation. Therefore, this work provides a facile, green, and efficient way for on-demand oil/water separation and finds a promising solution for oil pollution problems. 相似文献
895.
有时间窗的车辆路径问题及改进禁忌搜索算法 总被引:2,自引:0,他引:2
葛金辉 《吉林大学学报(理学版)》2011,49(1):105-111
基于改进的禁忌搜索算法求解有时间窗的车辆路径问题,建立了该问题的通用数学模型.改进算法中,在随机构造的多个可行解中挑选较好的解作为初始解,采用2-opt方法生成邻域,并构造了动态禁忌表,使禁忌表的大小和结构随搜索过程发生改变,提高了整体寻优能力.仿真实验证明了算法的可行性、有效性和优越性. 相似文献
896.
在恶劣的环境下传感器节点能量限制一直是制约油气管道物联网性能的关键因素.网络端对端延时决定了油气管道物联网对于管道安全事故的反应时间.为此,针对油气管道物联网能量限制和端对端延时问题提出基于多目标优化的管道物联网无线路由算法,通过将节点剩余能量以及节点到汇聚节点之间的距离作为机会路由中选择候选转发节点的指标,实现了物联... 相似文献
897.
求解车辆路径问题的改进遗传算法 总被引:1,自引:0,他引:1
陈久梅 《重庆工商大学学报(自然科学版)》2005,22(5):464-468
在建立车辆路径问题数学模型的基础上,设计了求解该问题的改进遗传算法,即采用自然数编码,构造一定长度的遗传个体表,动态记录适应度以及引入新交叉算子。实验结果表明,该算法用于求解车辆路径问题,不但可以解决传统遗传算法在求解该问题所遇到的“早熟收敛”,而且大大提高算法的运行效率。 相似文献
898.
针对多数无线传感器网络路由算法易在网络中形成关键节点,而节点的失效往往导致整个网络的失效问题,提出了将随机思想与蚁群算法的特征相结合的一种新的概率路由计算方法.实验表明,该算法对延长整个网络的有效生存时间的效果较好. 相似文献
899.
分析了无线传感器网络的分簇路由算法,针对现有算法存在的热点问题,提出一种基于分簇思想的能量高效路由算法.采用簇首轮转及局部竞争优化节点簇内通信的能量消耗,采用粒子群优化算法均优化簇首节点的簇间通信负载和能量消耗,从而延长网络的生命期.仿真结果表明,该算法能够有效提高无线传感器网络生存期以及节点与网络的能量利用率. 相似文献
900.
目的 研究移动Ad Hoc网络路由协议的规模性开销函数。方法 运用所提出的节点位置路由协议(NLRP,Node Location Routing Protocol)和节点移动性分析模型,推导了与位置更新和目的节点搜索有关的开销函数。结果 路由协议的总开销是凸函数,最佳位置更新阈值决定了路由开销。结论 对于给定的路由协议,网络的规模性取决于路由开销。根据路由请求到达的分布规律和节点的移动性,建立协议的开销函数,是进行网络优化和规模性研究的关键。 相似文献