920 search results - page 84 / 184 » Generating Satisfiable Problem Instances |
104
click to vote
AIPS
2006
15 years 2 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
ISCC
2005
IEEE
15 years 6 months ago
2005
IEEE
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
FCCM
2000
IEEE
15 years 5 months ago
2000
IEEE
For multiple FPGA systems, the limited number of I/O pins causes many problems. To solve these problems, efficient communication scheduling among FPGAs is crucial for obtaining hi...
COMPLEXITY
2004
15 years 15 days ago
2004
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
102
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...