Sciweavers

4335 search results - page 139 / 867
» Privatizing Constraint Optimization
Sort
View
ECAI
2000
Springer
15 years 7 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
102
Voted
IJCAI
2001
15 years 4 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
CORR
2010
Springer
67views Education» more  CORR 2010»
15 years 3 months ago
Using ATL to define advanced and flexible constraint model transformations
Abstract. Transforming constraint models is an important task in recent constraint programming systems. User-understandable models are defined during the modeling phase but rewriti...
Raphaël Chenouard, Laurent Granvilliers, Rica...
JAIR
2008
136views more  JAIR 2008»
15 years 3 months ago
Global Inference for Sentence Compression: An Integer Linear Programming Approach
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
James Clarke, Mirella Lapata
ICML
2007
IEEE
16 years 4 months ago
On the value of pairwise constraints in classification and consistency
In this paper we consider the problem of classification in the presence of pairwise constraints, which consist of pairs of examples as well as a binary variable indicating whether...
Jian Zhang, Rong Yan