8540 search results - page 372 / 1708 » The Dynamic Servers Problem |
132
click to vote
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
In highly power constrained sensor networks, harvesting energy from the environment makes prolonged or even perpetual execution feasible. In such energy harvesting systems, energy...
181
click to vote
PODS
1994
ACM
15 years 8 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
134
click to vote
ATMOS
2007
15 years 6 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
135
click to vote
ASPDAC
2000
ACM
15 years 8 months ago
2000
ACM
Simulated annealing has been one of the most popular stochastic optimization methods used in the VLSI CAD field in the past two decades for handling NP-hard optimization problems...
117
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper proposes a computational method of contact forces working between multibody system and environment in forward dynamics based on both the microbody-deformation model ...