14165 search results - page 448 / 2833 » The generalized two-server problem |
147
click to vote
ICALP
2005
Springer
16 years 11 days ago
2005
Springer
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
192
click to vote
ISAAC
2005
Springer
16 years 11 days ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
126
click to vote
MFCS
2005
Springer
16 years 10 days ago
2005
Springer
The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient a...
136
click to vote
ATAL
2004
Springer
16 years 8 days ago
2004
Springer
In multi-agent MDPs, it is generally necessary to consider the joint state space of all agents, making the size of the problem and the solution exponential in the number of agents...
149
Voted
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...