1071 search results - page 150 / 215 » Theories of Automatic Structures and Their Complexity |
ICCAD
1999
IEEE
14 years 13 days ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
AIEDAM
2007
13 years 8 months ago
2007
Because of the increasing complexity of products and the design process, as well as the popularity of computer-aided documentation tools, the number of electronic and textual desi...
DIMACS
1996
13 years 9 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
GECCO
2007
Springer
14 years 1 days ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...