8540 search results - page 246 / 1708 » The Dynamic Servers Problem |
131
Voted
STACS
2005
Springer
15 years 9 months 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...
147
click to vote
HYBRID
2009
Springer
15 years 10 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...
251
click to vote
ICDE
2005
IEEE
16 years 4 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...
125
Voted
GECCO
2007
Springer
15 years 9 months 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...
143
Voted
ICCS
2007
Springer
15 years 9 months 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...