80 search results - page 12 / 16 » A conflict based SAW method for Constraint Satisfaction Prob... |
CP
2003
Springer
15 years 7 months ago
2003
Springer
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
116
Voted
AI
2000
Springer
15 years 1 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
135
click to vote
EMSOFT
2010
Springer
14 years 11 months ago
2010
Springer
Correct and efficient implementation of general real-time applications remains by far an open problem. A key issue is meeting timing constraints whose satisfaction depends on feat...
SAC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
122
click to vote
CONSTRAINTS
2007
15 years 1 months ago
2007
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...