470 search results - page 68 / 94 » Tabu Search for SAT |
115
click to vote
BMCBI
2005
15 years 17 days ago
2005
Background: The protein folding problem is a fundamental problems in computational molecular biology and biochemical physics. Various optimisation methods have been applied to for...
97
Voted
AIR
1999
15 years 11 days ago
1999
The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints...
110
Voted
NETWORKS
2007
15 years 5 days ago
2007
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
IEAAIE
2010
Springer
14 years 10 months ago
2010
Springer
This work deals with an original problem with regard to the traditionally sequential planning process in public transit networks. This problem aims at modifying the network's ...
100
Voted
CADE
2002
Springer
16 years 1 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...