1300 search results - page 76 / 260 » Constraint satisfaction problems and global cardinality cons... |
140
click to vote
GECCO
2007
Springer
16 years 10 days ago
2007
Springer
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....
150
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
This paper concerns the problem of resource reasoning in planning. It defines formally a constraint satisfaction problem, the Time and Resource Problem (T RP), in which resource r...
152
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Many "semiring-like" structures are used in Soft Constraint Satisfaction Problems (SCSPs). We review a few properties of semirings that are useful for dealing w...
160
click to vote
ECSQARU
2009
Springer
15 years 4 months ago
2009
Springer
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
173
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...