Sciweavers

10907 search results - page 5 / 2182
» Constraint Based Strategies
Sort
View
CP
2009
Springer
14 years 8 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
AAAI
2006
13 years 8 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
EWCBR
2008
Springer
13 years 9 months ago
Competence-Preserving Case-Deletion Strategy for Case Base Maintenance
The main goal of a Case-Based Reasoning (CBR) system is to provide criteria for evaluating the internal behavior and task efficiency of a particular system for a given initial case...
Mohamed Karim Haouchine, Brigitte Chebel-Morello, ...
ISCAS
1994
IEEE
117views Hardware» more  ISCAS 1994»
13 years 11 months ago
Design of a Fast Sequential Decoding Algorithm Based on Dynamic Searching Strategy
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and p...
Wen-Wei Yang, Li-Fu Jeng, Chen-Yi Lee
PDP
2002
IEEE
14 years 9 days ago
A Fault-Tolerant Reservation-Based Strategy for Scheduling Aperiodic Tasks in Multiprocessor Systems
Periodic and aperiodic tasks co-exist in many realtime systems. The periodic tasks typically arise from sensor data or control loops, while the aperiodic tasks generally arise fro...
Chun-Hua Yang, Geert Deconinck