首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   755篇
  免费   44篇
  国内免费   8篇
化学   18篇
力学   38篇
综合类   31篇
数学   643篇
物理学   77篇
  2024年   2篇
  2023年   7篇
  2022年   11篇
  2021年   11篇
  2020年   8篇
  2019年   8篇
  2018年   16篇
  2017年   21篇
  2016年   28篇
  2015年   19篇
  2014年   64篇
  2013年   53篇
  2012年   40篇
  2011年   35篇
  2010年   45篇
  2009年   60篇
  2008年   51篇
  2007年   64篇
  2006年   24篇
  2005年   24篇
  2004年   14篇
  2003年   16篇
  2002年   17篇
  2001年   16篇
  2000年   20篇
  1999年   13篇
  1998年   8篇
  1997年   7篇
  1996年   9篇
  1995年   13篇
  1994年   6篇
  1993年   3篇
  1992年   7篇
  1991年   3篇
  1990年   2篇
  1989年   2篇
  1988年   11篇
  1987年   2篇
  1986年   2篇
  1985年   17篇
  1984年   7篇
  1983年   3篇
  1982年   5篇
  1981年   4篇
  1978年   2篇
  1977年   2篇
  1976年   1篇
  1975年   1篇
  1970年   1篇
  1957年   1篇
排序方式: 共有807条查询结果,搜索用时 0 毫秒
101.
We consider a location problem where the distribution of the existing facilities is described by a probability distribution and the transportation cost is given by a combination of transportation cost in a network and continuous distance. The motivation is that in many cases transportation cost is partly given by the cost of travel in a transportation network whereas the access to the network and the travel from the exit of the network to the new facility is given by a continuous distance.   相似文献   
102.
A stochastic manpower planning model under varying class sizes   总被引:1,自引:0,他引:1  
Solution related to different types of manpower planning problems arising in different industries and organizations are very much helpful for proper planning and implementation of different objectives. Previously those type of problems are mostly solved under the deterministic set up. Gradually several scientists have developed different types of stochastic models appropriate for solving such types of problems. The present study is an attempt to develop a stochastic manpower planning model under the set up where the classes are of varying sizes and promotion occurs only on the basis of seniority. The work of second author was supported by a research fellowship from Council of Scientific and Industrial Research (Sanction No. 9/28(611)/2003-EMR-I), India.  相似文献   
103.
An inventory model for a deteriorating item with stock dependent demand is developed under two storage facilities over a random planning horizon, which is assumed to follow exponential distribution with known parameter. For crisp deterioration rate, the expected profit is derived and maximized via genetic algorithm (GA). On the other hand, when deterioration rate is imprecise then optimistic/pessimistic equivalent of fuzzy objective function is obtained using possibility/necessity measure of fuzzy event. Fuzzy simulation process is proposed to maximize the optimistic/pessimistic return and finally fuzzy simulation-based GA is developed to solve the model. The models are illustrated with some numerical data. Sensitivity analyses on expected profit function with respect to distribution parameter λ and confidence levels α1 and α2 are also presented.  相似文献   
104.
近年来,随着变电站巡检机器人在变电站中的广泛使用,巡检机器人路径规划问题越来越成为亟待解决的问题。巡检机器人在已知的拓扑地图中标记了待执行巡检任务的停靠点,不同任务需要从初始点出发经过不同的一系列停靠点再返回初始点,如何规划路径是机器人面临的问题。首先分析了路径规划面临的问题,然后通过分析拓扑地图的特征,对地图进行等价简化,再对问题进行建模使用遗传算法求解巡检任务路径规划的近似最优解。通过仿真实验证明,提出的基于遗传算法的路径规划方法是可行有效的,为变电站巡检机器人任务路径规划提供了一种有效方法。  相似文献   
105.
利用数据库技术及网络技术,经过程序设计,动态链接和CAD绘图,城市规划监察管理信息系统可以提供建立、编辑、查询、统计、打印案卷以及系统维护等一系列功能,从而实现了规划监察的办公自动化,可供其他城市参考。  相似文献   
106.
In this paper, a methodology for generating automated solutions to the container stowage problem is shown. The methodology was derived by applying principles of combinatorial optimization and, in particular, the Tabu Search metaheuristic. The methodology progressively refines the placement of containers, using the Tabu search concept of neighbourhoods, within the cargo-space of a container ship until each container is specifically allocated to a stowage location. Heuristic rules are built into objective functions for each stage that enable the combinatorial tree to be explored in an intelligent way, resulting in good, if not optimal, solutions for the problem in a reasonable processing time.  相似文献   
107.
由于蚁群算法规划的最优路径存在尖峰和折线,研究利用三阶贝塞尔曲线对蚁群算法进行优化,通过选择可靠的控制点来控制最优路径的整体趋势,从而消除路径上的尖峰并对折线进行平滑处理;将优化后的蚁群算法在无人车自主导航中进行了应用,结果证明优化后的蚁群算法可以为无人车实时规划出一条高质量的最优路径,最优路径不仅有效地避开了障碍物,而且有效消除路径上尖峰和折线。  相似文献   
108.
陈炜峰  薛冬  周旺平 《应用声学》2014,22(11):3600-3602
针对未知环境下移动机器人路径规划和提高自主导航安全性问题,基于行为的控制结构思想,在此基础上提出了一种基于模糊控制的移动机器人路径规划算法;根据传感器接收的障碍物和目标距离方位信息,将路径规划分成避障行为、趋向目标行为;结合模糊逻辑理论和人类驾驶经验,制定模糊规则,输出转角和速度;仿真结果表明,移动机器人能够克服环境中的不确定性,有效地实现良好的路径规划,验证了模糊控制算法的可行性,体现了该路径规划策略的有效性和正确性。  相似文献   
109.
The paper describes the applicability of commercially available alanine detectors produced by Synergy Health for verification of the dose distribution calculated by the treatment planning system (TPS) used in proton eye radiotherapy – Eclipse Ocular Proton Planning (EOPP) program, version 8.9.06, Varian Medical Systems. The TPS-planned dose distribution at selected points in the eye phantom is compared to the dose registered by alanine detectors at these points during a simulated therapeutic irradiation at the proton eye radiotherapy facility in the Henryk Niewodniczanski Institute of Nuclear Physics (IFJ PAN), Krakow, Poland. The phantom was irradiated to obtain, a typical for choroidal melanoma, fraction dose of 15 CGE (13,64 Gy) at the tumor location. The dose registered with alanine pellets located inside the simulated tumor volume demonstrates a good agreement with the TPS-planned dose. The typical for proton radiotherapy, steep dose fall-off outside the treated area is registered by the alanine pellets however, it is difficult to assess it quantitatively, because the dose related EPR signal is registered from the entire pellet volume.  相似文献   
110.
This paper presents a dynamic production planning and scheduling algorithm for two products processed on one line over a fixed time horizon. Production rates are assumed fixed, and restrictions are placed or inventory levels and production run lengths. The resulting problem is a nonlinear binary program, which is solved using an implicit enumeration strategy. The algorithm focuses on the run changeover period while developing tighter bounds on the length of the upcoming run to improve computational efficiency. About 99% pf 297 randomly generated problems with varying demand patterns are solved in less than 15 seconds of CPU time on a CDC Cyber 172 Computer. A mixed integer programming formulation of the generalized multi-product case under no-backlogging of demand is also given.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号