13376 search results - page 220 / 2676 » Problem Solving with |
101
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
153
Voted
TSMC
2010
14 years 10 months ago
2010
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
127
Voted
AUSAI
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
118
Voted
BIRD
2007
Springer
15 years 9 months ago
2007
Springer
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
138
click to vote
FUN
2007
Springer
15 years 7 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...