Sciweavers

CP
2001
Springer
14 years 7 days ago
Optimal Pruning in Parametric Differential Equations
Initial value problems for parametric ordinary differential equations (ODEs) arise in many areas of science and engineering. Since some of the data is uncertain, traditional numer...
Micha Janssen, Pascal Van Hentenryck, Yves Deville
CP
2001
Springer
14 years 7 days ago
Partially Ordered Constraint Optimization Problems
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
Marco Gavanelli
CP
2001
Springer
14 years 7 days ago
Symmetry Breaking
Torsten Fahle, Stefan Schamberger, Meinolf Sellman...
CP
2001
Springer
14 years 7 days ago
Collaborative Learning for Constraint Solving
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
Susan L. Epstein, Eugene C. Freuder
CP
2001
Springer
14 years 7 days ago
Evaluation of Search Heuristics for Embedded System Scheduling Problems
Abstract. In this paper we consider the problem of optimal task allocation and scheduling in embedded real-time systems. This problem is far from trivial due to the wide range of c...
Cecilia Ekelin, Jan Jonsson
CP
2001
Springer
14 years 7 days ago
Automatic Generation of Implied Clauses for SAT
This paper presents a survey of the use of resolution in propositional satisfiability, and some preliminary results from the implementation of a hybrid resolution and search algor...
Lyndon Drake
CP
2001
Springer
14 years 7 days ago
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
Rina Dechter, Kalev Kask, Javier Larrosa
CP
2001
Springer
14 years 7 days ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken
CP
2001
Springer
14 years 7 days ago
Distributed Dynamic Backtracking
Christian Bessière, Arnold Maestre, Pedro M...
CP
2001
Springer
14 years 7 days ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi