Sciweavers

CP
2005
Springer
14 years 1 months ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck
CP
2005
Springer
14 years 1 months ago
Lookahead Saturation with Restriction for SAT
We present a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report o...
Anbulagan, John K. Slaney
CP
2005
Springer
14 years 1 months ago
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
Luca Benini, Davide Bertozzi, Alessio Guerri, Mich...
CP
2005
Springer
14 years 1 months ago
Bounds of Graph Characteristics
Abstract. This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme i...
Nicolas Beldiceanu, Thierry Petit, Guillaume Rocha...
CP
2005
Springer
14 years 1 months ago
Graph Invariants as Necessary Conditions for Global Constraints
Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global c...
Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Ram...
CP
2005
Springer
14 years 1 months ago
Incremental Algorithms for Local Search from Existential Second-Order Logic
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
Magnus Ågren, Pierre Flener, Justin Pearson
CP
2005
Springer
14 years 1 months ago
Distributed Constraints for Large-Scale Scheduling Problems
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
CD
2005
Springer
14 years 1 months ago
Cooperative Component-Based Software Deployment in Wireless Ad Hoc Networks
Abstract. This paper presents a middleware platform we designed in order to allow the deployment of component-based software applications on mobile devices (such as laptops or pers...
Hervé Roussain, Frédéric Guid...
CD
2005
Springer
14 years 1 months ago
Improving Availability in Large, Distributed Component-Based Systems Via Redeployment
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall av...
Marija Mikic-Rakic, Sam Malek, Nenad Medvidovic