Sciweavers

287 search results - page 31 / 58
» An Algebraic Approach to Constraint Satisfaction Problems
Sort
View
EMO
2009
Springer
174views Optimization» more  EMO 2009»
14 years 2 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck
NSDI
2007
13 years 10 months ago
Octant: A Comprehensive Framework for the Geolocalization of Internet Hosts
Determining the physical location of Internet hosts is a critical enabler for many new location-aware services. In this paper, we present Octant, a novel, comprehensive framework ...
Bernard Wong, Ivan Stoyanov, Emin Gün Sirer
CPAIOR
2008
Springer
13 years 9 months ago
A Novel Approach For Detecting Symmetries in CSP Models
Abstract. While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetr...
Christopher Mears, Maria J. García de la Ba...
RECOMB
2004
Springer
14 years 8 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
CP
2008
Springer
13 years 9 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang