Sciweavers

1071 search results - page 150 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 2 months ago
SAT based ATPG using fast justification and propagation in the implication graph
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 ...
Paul Tafertshofer, Andreas Ganz
AIEDAM
2007
191views more  AIEDAM 2007»
14 years 10 months ago
Ontology-based design information extraction and retrieval
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...
Zhanjun Li, Karthik Ramani
DIMACS
1996
14 years 11 months ago
Easier Ways to Win Logical Games
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...
Ronald Fagin
COMPGEOM
2009
ACM
15 years 4 months ago
Near-linear approximation algorithms for geometric hitting sets
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...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 1 months ago
Crossover: the divine afflatus in search
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 ...
David Iclanzan