6943 search results - page 893 / 1389 » Representations for evolutionary algorithms |
197
click to vote
CVPR
1997
IEEE
15 years 11 months ago
1997
IEEE
We describe a linear algorithm to recover 30 afJine slzape/niotionfrom line correspondences over three views with uncalibrated afine cameras. The key idea is the introduction of a...
177
click to vote
WIA
1998
Springer
15 years 11 months ago
1998
Springer
A cover-automaton A of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic co...
198
click to vote
EURODAC
1994
IEEE
15 years 11 months ago
1994
IEEE
This paper presents an algorithm for generation of test patterns for strong robust path delay faults, i.e. tests that propagate the fault along a single path and additionally are ...
192
click to vote
DAC
1994
ACM
15 years 11 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
212
click to vote
AINA
2007
IEEE
15 years 11 months ago
2007
IEEE
Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potent...