Sciweavers

1264 search results - page 38 / 253
» The framework approach for constraint satisfaction
Sort
View
CONSTRAINTS
2006
70views more  CONSTRAINTS 2006»
15 years 6 months ago
Stochastic Constraint Programming: A Scenario-Based Approach
To model combinatorial decision problems involving uncertainty and probability, we introduce scenario based stochastic constraint programming. Stochastic constraint programs conta...
Armagan Tarim, Suresh Manandhar, Toby Walsh
RECOMB
2004
Springer
16 years 6 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...
139
Voted
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
16 years 7 days ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson
FLAIRS
2008
15 years 8 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
IDEAS
2005
IEEE
109views Database» more  IDEAS 2005»
15 years 11 months ago
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes
We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous...
Chuang Liu, Lingyun Yang, Ian T. Foster