2100 search results - page 9 / 420 » Fundamentals of the problem |
STACS
2000
Springer
13 years 11 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
TIT
1998
13 years 7 months ago
1998
Abstract—A brief chronicle is given of the historical development of the central problems in the theory of fundamental limits of data compression and reliable communication.
TCS
2008
13 years 7 months ago
2008
Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper...
GCC
2003
Springer
14 years 28 days ago
2003
Springer
Time constraint is a key problem in workflow management. Now, with the emergence of new technologies such as web service, grid, this problem has become more complicated in service-...