805 search results - page 91 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
135
click to vote
ANOR
2010
15 years 4 months ago
2010
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
296
Voted
EOR
2007
15 years 4 months ago
2007
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
147
click to vote
SAC
2000
ACM
15 years 9 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
195
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper we study the human eye movement and the head movement system as a simple mechanical control system. Most of the time, eye movements obey Listing's constraint, wh...
125
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...