Results 1 to 10 of about 151,821 (357)
The role of commutativity in constraint propagation algorithms [PDF]
ACM Transactions on Programming Languages and Systems, 2000 Constraing propagation algorithms form an important part of most of the constraint programming systems. We provide here a simple, yet very general framework that allows us to explain several constraint propagation algorithms in a systematic way. In this framework we proceed in two steps.
Krzysztof R. Apt
openalex +6 more sources
Filtering algorithms for global chance constraints
Artificial Intelligence, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brahim Hnich +3 more
openalex +7 more sources
Filtering Algorithms for the NValue Constraint [PDF]
Constraints, 2005 The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We show that computing even the lower bound on the number of values is NP-hard. We therefore study different approximation heuristics for this problem.
Christian Bessiere +4 more
openaire +6 more sources
The Geometry of Algorithms with Orthogonality Constraints [PDF]
SIAM Journal on Matrix Analysis and Applications, 1998 In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal processing. In addition to the new algorithms, we show how the
Alan Edelman +2 more
openaire +2 more sources
Fast Algorithms for Denial Constraint Discovery [PDF]
Proceedings of the VLDB Endowment, 2022 Denial constraints (DCs) are an integrity constraint formalism widely used to detect inconsistencies in data. Several algorithms have been devised to discover DCs from data, as manually specifying them is burdensome and, worse yet, error-prone. The existing algorithms follow two basic steps: building an intermediate data structure from records, then ...
Pena, Eduardo H. M. +2 more
openaire +1 more source
The Range Constraint: Algorithms and Implementation [PDF]
, 2006 N ...
Christian Bessiere +4 more
openaire +3 more sources
Dominance Constraints: Algorithms and Complexity [PDF]
, 2001 Dominance constraints for finite tree structures are widely used in several areas of computational linguistics including syntax, semantics, and discourse. In this paper, we investigate algorithmic and complexity questions for dominance constraints and their first-order theory.
Alexander Koller +2 more
openaire +1 more source
Evolving algorithms for constraint satisfaction [PDF]
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), 2004 This paper proposes a framework for automatically evolving constraint satisfaction algorithms using genetic programming. The aim is to overcome the difficulties associated with matching algorithms to specific constraint satisfaction problems. A representation is introduced that is suitable for genetic programming and that can handle both complete and ...
Stuart Bain +2 more
openaire +1 more source
Quantified Constraints: Algorithms and Complexity
, 2003 The standard constraint satisfaction problem over an arbitrary finite domain can be expressed as follows: given a first-order sentence consisting of a conjunction of predicates, where all of the variables are existentially quantified, determine whether the sentence is true.
Borner, F +3 more
openaire +3 more sources