88 search results - page 4 / 18 » Solving Non-Boolean Satisfiability Problems with Stochastic ... |
ICML
2003
IEEE
14 years 6 months ago
2003
IEEE
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and com...
CP
2009
Springer
14 years 16 days ago
2009
Springer
Abstract. VLSI chips design is becoming increasingly complex and calling for more and more automation. Many chip design problems can be formulated naturally as constraint problems ...
AI
2003
Springer
13 years 11 months ago
2003
Springer
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
AI
2003
Springer
13 years 11 months ago
2003
Springer
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
ECAI
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...