304 search results - page 57 / 61 » Exploiting problem structure in a genetic algorithm approach... |
ICCAD
1999
IEEE
14 years 1 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 ...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
CASES
2010
ACM
13 years 5 months ago
2010
ACM
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
PAMI
2007
13 years 7 months ago
2007
—An open vision problem is to automatically track the articulations of people from a video sequence. This problem is difficult because one needs to determine both the number of p...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...