206 search results - page 24 / 42 » Distributed Partial Constraint Satisfaction Problem |
188
Voted
CP
2003
Springer
16 years 51 min ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
179
Voted
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
194
Voted
PRICAI
2004
Springer
16 years 3 days ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
185
Voted
CEC
2005
IEEE
16 years 12 days ago
2005
IEEE
Abstract- This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity di...
327
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...