Sciweavers

4451 search results - page 229 / 891
» On Random Ordering Constraints
Sort
View
AAAI
2008
15 years 9 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
AIPS
2009
15 years 7 months ago
Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints
Recently, Helmert and Geffner proposed the context-enhanced additive heuristic, where fact costs are evaluated relative to context states that arise from achieving first a pivot c...
Dunbo Cai, Jörg Hoffmann, Malte Helmert
JAIR
2008
121views more  JAIR 2008»
15 years 6 months ago
A Constraint Programming Approach for Solving a Queueing Control Problem
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custom...
Daria Terekhov, J. Christopher Beck
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
16 years 7 months ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt
ICTAI
2007
IEEE
16 years 27 days ago
Curve Clustering with Spatial Constraints for Analysis of Spatiotemporal Data
In this paper we present a new approach for curve clustering designed for analysis of spatiotemporal data. Such kind of data contains both spatial and temporal patterns that we de...
Konstantinos Blekas, Christophoros Nikou, Nikolas ...