1453 search results - page 77 / 291 » Partial Constraint Satisfaction |
180
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...
161
click to vote
HICSS
2008
IEEE
16 years 1 months ago
2008
IEEE
In recent years, instant messaging (IM) has become a popular medium of online communication. While IM is expanding into the enterprise beyond personal use, it brings the convenien...
167
click to vote
CP
2009
Springer
16 years 1 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
169
click to vote
SARA
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
150
click to vote
ICCBR
2003
Springer
15 years 12 months ago
2003
Springer
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...