Sciweavers

2861 search results - page 120 / 573
» Constraint Programming
Sort
View
CP
2006
Springer
15 years 1 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
15 years 4 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...
CP
2004
Springer
15 years 3 months ago
A Domain Consistency Algorithm for the Stretch Constraint
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consist...
Lars Hellsten, Gilles Pesant, Peter van Beek
IJON
2008
92views more  IJON 2008»
14 years 10 months ago
Nonnegative matrix factorization with quadratic programming
Nonnegative Matrix Factorization (NMF) solves the following problem: find such nonnegative matrices A RI
Rafal Zdunek, Andrzej Cichocki
4OR
2004
90views more  4OR 2004»
14 years 9 months ago
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
Giorgio Fasano