Sciweavers

790 search results - page 91 / 158
» Limits of Work-Stealing Scheduling
Sort
View
115
Voted
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
13 years 3 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal
79
Voted
COCO
2005
Springer
72views Algorithms» more  COCO 2005»
15 years 6 months ago
Toward a Model for Backtracking and Dynamic Programming
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...
VTS
2003
IEEE
81views Hardware» more  VTS 2003»
15 years 5 months ago
Test Resource Partitioning and Optimization for SOC Designs
1 We propose a test resource partitioning and optimization technique for core-based designs. Our technique includes test set selection and test resource floor-planning with the ai...
Erik Larsson, Hideo Fujiwara
125
Voted
FGR
2002
IEEE
185views Biometrics» more  FGR 2002»
15 years 5 months ago
An Adaptive Fusion Architecture for Target Tracking
A vision system is demonstrated that adaptively allocates computational resources over multiple cues to robustly track a target in 3D. The system uses a particle filter to mainta...
Gareth Loy, Luke Fletcher, Nicholas Apostoloff, Al...
108
Voted
IJCAI
2003
15 years 2 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...