422 search results - page 81 / 85 » Multithreaded SAT Solving |
175
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
178
Voted
IFM
2007
Springer
16 years 14 days ago
2007
Springer
Material Flow Abstraction of Manufacturing Systems. ‣Umberto Costa, Ivan de Medeiros Jr and Marcel Oliveira. Specification and Verification of a MPI Implementation for a MP-SoC...
275
Voted
ICTAC
2010
Springer
15 years 4 months ago
2010
Springer
Material Flow Abstraction of Manufacturing Systems. ‣Umberto Costa, Ivan de Medeiros Jr and Marcel Oliveira. Specification and Verification of a MPI Implementation for a MP-SoC...
198
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
167
click to vote
AI
2000
Springer
15 years 6 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...