1480 search results - page 131 / 296 » Ants can solve constraint satisfaction problems |
163
click to vote
SMI
2006
IEEE
16 years 14 days ago
2006
IEEE
In this paper, we propose a constrained least squares approach for stably computing Laplacian deformation with strict positional constraints. In the existing work on Laplacian def...
171
click to vote
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
144
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
Networks of communicating finite-state machines equipped with local clocks generate timed MSCs. We consider the problem of checking whether these timed MSCs are "consistent&qu...
160
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
135
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
The optimization of the epoxy polymerization process involves a number of conflicting objectives and more than twenty decision parameters. In this paper, the problem is treated tr...