Sciweavers

209 search results - page 13 / 42
» Speeding Up Constraint Propagation
Sort
View
ISCAS
2007
IEEE
103views Hardware» more  ISCAS 2007»
16 years 28 days ago
Multi-Vth Level Conversion Circuits for Multi-VDD Systems
— Employing multiple supply voltages (multi-VDD) is attractive for reducing the power consumption without sacrificing the speed of an integrated circuit (IC). In order to transfe...
Sherif A. Tawfik, Volkan Kursun
AAAI
1994
15 years 8 months ago
Dead-End Driven Learning
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
Daniel Frost, Rina Dechter
IJAIT
2008
99views more  IJAIT 2008»
15 years 6 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
DATE
2007
IEEE
167views Hardware» more  DATE 2007»
16 years 1 months ago
A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multip
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
Nadathur Satish, Kaushik Ravindran, Kurt Keutzer
CP
2007
Springer
16 years 25 days ago
Solution Counting Algorithms for Constraint-Centered Search Heuristics
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
Alessandro Zanarini, Gilles Pesant