14386 search results - page 228 / 2878 » The Chinese Generals Problem |
137
Voted
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...
139
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...
143
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...
154
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
194
click to vote
GECCO
2011
Springer
14 years 8 months ago
2011
Springer
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...