126 search results - page 8 / 26 » sara 2007 |
SARA
2007
Springer
14 years 4 months ago
2007
Springer
Several recent techniques for solving Markov decision processes use dynamic Bayesian networks to compactly represent tasks. The dynamic Bayesian network representation may not be g...
SARA
2007
Springer
14 years 4 months ago
2007
Springer
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...
SARA
2007
Springer
14 years 4 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 4 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...
BMCBI
2005
13 years 9 months ago
2005