Sciweavers

9842 search results - page 1495 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICRA
2002
IEEE
98views Robotics» more  ICRA 2002»
15 years 12 months ago
An Efficient Coordination Architecture for Autonomous Robot Teams
Most physically implemented multi-robot controllers are based on extensions of behavior-based systems. While efficient, such techniques suffer from weak representational power. Sy...
Aaron Khoo, Ian Douglas Horswill
IPPS
2002
IEEE
15 years 12 months ago
Generating Parallel Programs from the Wavefront Design Pattern
Object-oriented programming, design patterns, and frameworks are common techniques that have been used to reduce the complexity of sequential programming. We have applied these te...
John Anvik, Steve MacDonald, Duane Szafron, Jonath...
ITC
2002
IEEE
112views Hardware» more  ITC 2002»
15 years 12 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
ITC
2002
IEEE
81views Hardware» more  ITC 2002»
15 years 12 months ago
Design Rewiring Using ATPG
—Logic optimization is the step of the very large scale integration (VLSI) design cycle where the designer performs modifications on a design to satisfy different constraints suc...
Andreas G. Veneris, Magdy S. Abadir, Mandana Amiri
SAC
2010
ACM
15 years 11 months ago
Data stream anomaly detection through principal subspace tracking
We consider the problem of anomaly detection in multiple co-evolving data streams. In this paper, we introduce FRAHST (Fast Rank-Adaptive row-Householder Subspace Tracking). It au...
Pedro Henriques dos Santos Teixeira, Ruy Luiz Mili...
« Prev « First page 1495 / 1969 Last » Next »