SARA
2007
Springer
14 years 5 months 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...
SARA
2007
Springer
14 years 5 months ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
SARA
2007
Springer
14 years 5 months ago
2007
Springer
SARA
2007
Springer
14 years 5 months ago
2007
Springer
SARA
2007
Springer
14 years 5 months ago
2007
Springer
Multi-robot area coverage poses several research challenges. The challenge of coordinating multiple robots’ actions coupled with the challenge of minimizing the overlap in covera...
SARA
2007
Springer
14 years 5 months ago
2007
Springer
Though there exist some rules of thumb for design of good models for solving constraint satisfaction problems, the modeling process still belongs more to art than to science. Moreo...
SARA
2007
Springer
14 years 5 months ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
SARA
2007
Springer
14 years 5 months ago
2007
Springer