Sciweavers

4860 search results - page 584 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
131
Voted
ITC
2002
IEEE
112views Hardware» more  ITC 2002»
15 years 10 months ago
Multiplets, Models, and the Search for Meaning: Improving Per-Test Fault Diagnosis
The advantage to “one test at a time” fault diagnosis is its ability to implicate the components of complicated defect behaviors. The disadvantage is the large size and opacit...
David B. Lavo, Ismed Hartanto, Tracy Larrabee
CDC
2009
IEEE
113views Control Systems» more  CDC 2009»
15 years 9 months ago
Computation of safety control for uncertain piecewise continuous systems on a partial order
— In this paper, the safety control problem for a class of hybrid systems with disturbance inputs and imperfect continuous state information is considered. Under the assumption t...
Michael R. Hafner, Domitilla Del Vecchio
126
Voted
LATA
2009
Springer
15 years 9 months ago
Nested Counters in Bit-Parallel String Matching
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism...
Kimmo Fredriksson, Szymon Grabowski
135
Voted
IPPS
1999
IEEE
15 years 9 months ago
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne,...
CAV
2006
Springer
128views Hardware» more  CAV 2006»
15 years 8 months ago
Safraless Compositional Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, litt...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi