465 search results - page 49 / 93 » On the Hardness of Range Assignment Problems |
109
click to vote
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
103
click to vote
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
We describe some techniques that can be used to represent and detect deformable shapes in images. The main difficulty with deformable template models is the very large or infinite...
CEC
2009
IEEE
15 years 6 months ago
2009
IEEE
— Genetic algorithms (GAs) have been argued to constitute a flexible search thereby enabling to solve difficult problems which classical optimization methodologies may find ha...
107
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
102
click to vote
KI
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...