首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   163篇
  免费   26篇
  国内免费   21篇
化学   15篇
晶体学   1篇
力学   14篇
综合类   5篇
数学   140篇
物理学   35篇
  2022年   9篇
  2021年   3篇
  2020年   8篇
  2019年   5篇
  2018年   4篇
  2017年   11篇
  2016年   9篇
  2015年   8篇
  2014年   14篇
  2013年   12篇
  2012年   12篇
  2011年   17篇
  2010年   17篇
  2009年   7篇
  2008年   10篇
  2007年   4篇
  2006年   8篇
  2005年   10篇
  2004年   3篇
  2003年   9篇
  2002年   5篇
  2001年   8篇
  2000年   3篇
  1999年   1篇
  1998年   1篇
  1997年   6篇
  1996年   3篇
  1995年   1篇
  1994年   1篇
  1993年   1篇
排序方式: 共有210条查询结果,搜索用时 31 毫秒
11.
The NP-hard problem of car sequencing appears as the heart of the logistic process of many car manufacturers. The subject of the ROADEF’2005 challenge addressed a car sequencing problem proposed by the car manufacturer RENAULT, more complex than the academic problem generally addressed in the literature. This paper describes two local search approaches for this problem. In the first part, a new approach by very large-scale neighborhood search is presented. This approach, designed during the qualification stage preceding the final, is based on an original integer linear programming formulation. The second part is dedicated to the approach which enabled us to win the ROADEF’2005 challenge. Inspired by the latest works on the subject, this one is based on very fast explorations of small neighborhoods. Our contribution here is mainly algorithmic, in particular by showing how much exploiting invariants speeds up the neighborhood evaluation and contributes to the diversification of the search. Finally, the two approaches are compared and discussed through an extensive computational study on RENAULT’s benchmarks. The main conclusion drawn at this point is that sophisticated metaheuristics are useless to solve car sequencing problems. More generally, our victory on ROADEF’2005 challenge demonstrates that algorithmic aspects, sometimes neglected, remain the key ingredients for designing and engineering high-performance local search heuristics.  相似文献   
12.
传统的基于形状信息目标定位的算法,对目标观测角度发生形变情况下的定位存在不少困难,针对该问题,提出了一种基于稀疏活动轮廓模型的感兴趣目标(OOI)检测算法.首先通过共同勾画算法学习到感兴趣目标的稀疏活动轮廓模型,它能够清晰地定义感兴趣目标模式;同时构成该模型的Gabor轮廓基元可以通过扰动进行局部的调整以适配图像,在一...  相似文献   
13.
多模跟踪技术在轮式侦察车图像处理器的应用   总被引:1,自引:0,他引:1  
郝志成  高文 《中国光学》2011,4(5):480-488
为解决目标旋转形变、遮挡、光照变化等目标跟踪的难题,对粒子滤波和尺度不变特征变换(SIFT)算法进行了改进,结合两种算法提出了决策主导模式的多模跟踪技术。该技术采用粒子滤波预测目标位置进行粗定位,SIFT特征匹配进行精定位的方法,在解决上述难题上有很好的鲁棒性。将该技术应用于轮式侦察车图像处理器,并进行了各种实验验证,结果证明了提出算法的有效性。  相似文献   
14.
In this paper,by using the idea of truncated counting functions of meromorphic functions,we deal with the problem of uniqueness of the meromorphic functions whose certain nonlinear differential polynomials share one finite nonzero value.  相似文献   
15.
In this article, we use Zalcman Lemma to investigate the normal family of meromorphic functions concerning shared values, which improves some earlier related results.  相似文献   
16.
In this article, we mainly devote to proving uniqueness results for entire functions sharing one small function CM with their shift and difference operator simultaneously. Let f(z) be a nonconstant entire function of finite order, c be a nonzero finite complex constant,and n be a positive integer. If f(z), f(z + c), and ?_c~n f(z) share 0 CM, then f(z + c) ≡ Af(z),where A(= 0) is a complex constant. Moreover, let a(z), b(z)( ≡ 0) ∈ S(f) be periodic entire functions with period c and if f(z)-a(z), f(z + c)-a(z), ?_c~n f(z)-b(z) share 0 CM, then f(z + c) ≡ f(z).  相似文献   
17.
We consider a scheduling problem motivated by mining in remote off-grid areas. In this model, mines have pre-assigned mineral processing jobs and their own machine for executing these jobs. Each job also needs a certain amount of electricity in order to get completed. The electricity, on the other hand, is of limited supply and must be shared between the mines. We present a mathematical formulation of the problem and a Lagrangian relaxation based heuristic. Computational results which compares our heuristic with genetic algorithm and simulated annealing are also presented.  相似文献   
18.
We deal with the problem of entire functions sharing one value weakly. Moreover, we improve and generalize some former results obtained by J.-F.Chen, et al. [6], Y.Xu and H.L.Qiu [4], M.L. Fang [5], C.C. Yang, and X.H. Hua [3].  相似文献   
19.
王建平 《数学杂志》2006,26(1):31-36
本文利用Gundersen的方法研究了一个线性微分方程的解并证明此方程的每一个整函数解的级必为无穷,推广了Gundersen和杨连中的若干结果。作为应用,我们还研究了与导数具有公共不动点的整函数.  相似文献   
20.
张庆德  秦春艳 《数学学报》2008,51(1):145-152
根据Nevanlinna理论讨论了一族亚纯函数中每个函数与其k(k为任一正整数)阶导数单向分担3个有限复值时的正规性,并举例说明这一结果是精确的.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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