1483 search results - page 64 / 297 » Geometric constraint satisfaction using optimization methods |
136
click to vote
AUSAI
2008
Springer
15 years 3 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
120
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a novel method for finding more good feature pairs between two sets of features. We first select matched features by Bi-matching method as seed points, then organize th...
139
click to vote
IJCAI
2001
15 years 2 months ago
2001
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
117
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
123
click to vote
CP
2003
Springer
15 years 6 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...