920 search results - page 9 / 184 » Generating Satisfiable Problem Instances |
AAAI
2006
13 years 9 months ago
2006
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...
IJAIT
2008
13 years 7 months ago
2008
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
EOR
2007
13 years 7 months ago
2007
The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90° so long as they are packed with ...
DAC
2002
ACM
14 years 8 months ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...