助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[249622]条 当前为第61条到80条[由于搜索限制,当前仅支持显示前5页数据]
 

相关语句
time
The well-posedness for the time-dependent neutron transport equation with integral boundary conditions is established inL1 space.
      
In the present paper, we deal with the long-time behavior of dissipative partial differential equations, and we construct the approximate inertial manifolds for the nonlinear Schr?dinger equation with a zero order dissipation.
      
Spatial discretization can be performed by either Galerkin spectral method or nonlinear Galerkin spectral method; time discretization is done by Euler scheme which is explicit or implicit in the nonlinear terms.
      
A system receives shocks at successive random points of discrete time, and each shock causes a positive integer-valued random amount of damage which accumulates on the system one after another.
      
In previous work, under some assumptions, we specified a replacement rule which minimizes the long-run (expected) average cost per unit time and possesses control limit property.
      
We present a new algorithm, with computational evidence to suggest an expected run-time growth rate belowO(n3).
      
In a life test with 20 sets of bearings, only one set failed within the specified time, and none of the remainder failed even after the time of test has been extended.
      
With a set of testing data like that in Table 1, it is required to estimate the reliability at the mission time.
      
Exact bounds of the modified lpt algorithms applying to parallel machines scheduling with nonsimultaneous machine available time
      
In this paper, we consider Parallel Machines Scheduling with nonsimultaneous machine available time.
      
The design that is subject to this criterion satisfies many kinds of linear optimal criterion and D-optimal criterion on several experiment models at the same time.
      
The well-posedness and validity of formal approximations on a long time scale of order ∣ε∣-1 are discussed in the classical sense of C2.
      
79 competitive online algorithm for two processor real-time systems with uniform value density
      
We consider the problem of competitive on-line scheduling in two processor real-time systems.
      
Each task has a release time, an execution time and a deadline.
      
Continuous-time procedure is introduced and analysed.
      
It is proved that when the solution is blow-up in a finite time s(uo), and u0(x) is not a constant, then the free boundary will not be blow-up and the blow-up set is contained in the interval [0,l0).
      
It is shown that under certain conditions the solution blows up at a finite time and the blow-up only occurs on the boundary.
      
The result shows that most inverse network optimization problems with l∞ objective function can be solved in the polynomial time.
      
However, in many practical situations, a manager may control processing time by reallocating resources.
      
 

首页上一页12345下一页尾页 

 
CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社