14165 search results - page 273 / 2833 » The generalized two-server problem |
182
click to vote
IJCAI
2001
15 years 8 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
167
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
177
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...
182
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
195
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Surprisingly, console logs rarely help operators detect problems in large-scale datacenter services, for they often consist of the voluminous intermixing of messages from many sof...