96 search results - page 1 / 20 » Combining Two Local Search Approaches to Hypergraph Partitio... |
IJCAI
2003
14 years 7 months ago
2003
We study leading-edge local search heuristics for balanced hypergraph partitioning and Boolean satisfiability, intending the generalization of such heuristics beyond their origina...
GECCO
2003
Springer
14 years 11 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
AIIA
2009
Springer
15 years 17 days ago
2009
Springer
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...
FROCOS
2011
Springer
13 years 5 months ago
2011
Springer
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...
GECCO
2004
Springer
14 years 11 months ago
2004
Springer
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic whic...