Sciweavers

5592 search results - page 1 / 1119
» On Random Betweenness Constraints
Sort
View
FCT
2009
Springer
13 years 11 months ago
On Random Betweenness Constraints
Despite of their applicability betweennness constraints have (to the authorā€™s knowledge) hardly been considered from the random structures point of view. They are essentially diļ...
Andreas Goerdt
RSA
2006
104views more  RSA 2006»
13 years 4 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
CSR
2009
Springer
13 years 11 months ago
On Random Ordering Constraints
Abstract. Ordering constraints are analogous to instances of the satisļ¬ability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
Andreas Goerdt
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
13 years 8 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is speciļ¬ed to lie in...
Benny Chor, Madhu Sudan
CPAIOR
2009
Springer
13 years 11 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou