224 search results - page 29 / 45 » Algorithms for Solving Boolean Satisfiability in Combination... |
133
click to vote
ICCAD
2001
IEEE
16 years 18 days ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
137
Voted
DATE
2006
IEEE
15 years 7 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
119
Voted
ATVA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
134
click to vote
NECO
2008
15 years 3 months ago
2008
While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We desc...
151
click to vote
TEC
2002
15 years 3 months ago
2002
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...