Sciweavers

6456 search results - page 161 / 1292
» Constraint Solving on Terms
Sort
View
AIPS
2006
15 years 7 months ago
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...
Roman Barták, Ondrej Cepek
CORR
2004
Springer
152views Education» more  CORR 2004»
15 years 6 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
ANOR
2007
108views more  ANOR 2007»
15 years 6 months ago
Towards a practical engineering tool for rostering
The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability to schedule their personnel properly. Sophisticated an...
Edward P. K. Tsang, John A. Ford, Patrick Mills, R...
EAAI
2010
86views more  EAAI 2010»
15 years 6 months ago
Resolution of nonlinear interval problems using symbolic interval arithmetic
: An interval problem is a problem where the unknown variables take interval values. Such a problem can be defined by interval constraints, such as "the interval [a, b] [a, b...
Luc Jaulin, Gilles Chabert
PADL
2010
Springer
16 years 3 months ago
Lazy Explanations for Constraint Propagators
Explanations are a technique for reasoning about constraint propagation, which have been applied in many learning, backjumping and user-interaction algorithms for constraint progra...
Ian P. Gent, Ian Miguel, Neil C. A. Moore