805 search results - page 79 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
153
click to vote
IJCAI
2003
15 years 5 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
163
click to vote
ICICIC
2006
IEEE
15 years 10 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
133
click to vote
IUI
2004
ACM
15 years 10 months ago
2004
ACM
In order to give people ubiquitous access to software applications, device controllers, and Internet services, it will be necessary to automatically adapt user interfaces to the c...
127
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
160
click to vote
COR
2007
15 years 4 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...