197 search results - page 3 / 40 » Advances in Local Search for Satisfiability |
CEC
2005
IEEE
13 years 11 months ago
2005
IEEE
AAAI
2000
13 years 7 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
DATE
2004
IEEE
13 years 9 months ago
2004
IEEE
Advances in Boolean satisfiability solvers have popularized their use in many of today's CAD VLSI challenges. Existing satisfiability solvers operate on a circuit representat...
JCM
2007
13 years 5 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
SAT
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...