Sciweavers

591 search results - page 17 / 119
» A constraint programming approach to cutset problems
Sort
View
TKDE
2012
245views Formal Methods» more  TKDE 2012»
11 years 9 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
CORR
2007
Springer
112views Education» more  CORR 2007»
13 years 6 months ago
Adaptive Methods for Linear Programming Decoding
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
Mohammad H. Taghavi, Paul H. Siegel
ICML
2009
IEEE
14 years 7 months ago
Constraint relaxation in approximate linear programs
Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for...
Marek Petrik, Shlomo Zilberstein
CP
2003
Springer
13 years 12 months ago
An Algebraic Approach to Multi-sorted Constraints
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
Andrei A. Bulatov, Peter Jeavons
SARA
2009
Springer
14 years 1 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...