8540 search results - page 246 / 1708 » The Dynamic Servers Problem |
172
click to vote
STACS
2005
Springer
16 years 15 hour ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
190
click to vote
HYBRID
2009
Springer
16 years 1 months ago
2009
Springer
We investigate a new approach for solving boundary control problems for dynamical systems that are governed by transport equations, when the control function is restricted to binar...
298
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
We introduce a network-based problem detection framework for distributed systems, which includes a data-mining method for discovering dynamic dependencies among distributed servic...
156
click to vote
GECCO
2007
Springer
16 years 21 days ago
2007
Springer
This paper formally presents the resident physician scheduling problem, which is one of the most important scheduling problems in hospital. The resident physician scheduling probl...
204
click to vote
ICCS
2007
Springer
16 years 21 days ago
2007
Springer
Assimilation of spatially- and temporally-distributed state observations into simulations of dynamical systems stemming from discretized PDEs leads to inverse problems with high-di...