Results 311 to 320 of about 151,821 (357)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Constraint programming and graph algorithms
Annals of Mathematics and Artificial Intelligence, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Gangnet, Burton Rosenberg
openaire +2 more sources
Algorithms and Constraint Programming
2006Constraint Programming is a powerful programming paradigm with a great impact on a number of important areas such as logic programming[45], concurrent programming[42], artificial intelligence[12], and combinatorial optimization[46]. We believe that constraint programming is also a rich source of many challenging algorithmic problems, and cooperations ...
Fabrizio Grandoni 0001 +1 more
openaire +1 more source
A Simple Algorithm for Mal'tsev Constraints
SIAM Journal on Computing, 2006A Mal'tsev operation is a ternary operation $\varphi$ that satisfies the identities $\varphi(x,y,y) = \varphi(y,y,x) = x$. Constraint satisfaction problems involving constraints invariant under a Mal'tsev operation constitute an important class of constraint satisfaction problems, which includes the affine satisfiability problem, subgroup and near ...
Andrei A. Bulatov, Víctor Dalmau
openaire +1 more source
Filtering Algorithms for the Same Constraint
2004We define the Same and UsedBy constraints. UsedBy takes two sets of variables X and Z such that |X| ≥ |Z| and assigns values to them such that the multiset of values assigned to the variables in Z is contained in the multiset of values assigned to the variables in X. Same is the special case of UsedBy in which |X|=|Z|.
Beldiceanu, N., Katriel, I., Thiel, S.
openaire +2 more sources
A reading algorithm for constraint diagrams
IEEE Symposium on Human Centric Computing Languages and Environments, 2003. Proceedings. 2003, 2004Constraint diagrams are a visual notation designed to complement the Unified Modeling Language in the development of software systems. They generalize Venn diagrams and Euler circles, and include facilities for quantification and navigation of relations. Their design emphasizes scalability and expressiveness while retaining intuitiveness.
Andrew Fish, Jean Flower, John Howse
openaire +1 more source
Constraints in Graph Drawing Algorithms
Constraints, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The FastICA algorithm with spatial constraints
IEEE Signal Processing Letters, 2005In many blind source separation (BSS) applications, especially for biomedical signal processing, there are specific expectations regarding the spatial and temporal characteristics of some sources, but post-hoc comparisons between source estimates and anticipated outcomes can be complicated and unreliable.
Christian W. Hesse, Christopher J. James
openaire +2 more sources
Efficient Algorithms for Functional Constraints
2008Functional constraints are an important constraint class in Constraint Programming (CP) systems, in particular for Constraint Logic Programming (CLP) systems. CP systems with finite domain constraints usually employ CSP-based solvers which use local consistency, e.g. arc consistency.
Yuanlin Zhang 0002 +3 more
openaire +1 more source

