2398 search results - page 34 / 480 » Constraint Programming and Graph Algorithms |
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
IJCAI
2007
13 years 10 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
CSCLP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
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...