14165 search results - page 193 / 2833 » The generalized two-server problem |
134
click to vote
IJCAI
2003
15 years 5 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
172
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
133
click to vote
SARA
2009
Springer
15 years 11 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
136
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
141
click to vote
GBRPR
2005
Springer
15 years 10 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...