In our experiments with four well-known systems for solving partially observable planning problems (Contingent-FF, MBP, PKS, and POND), we were greatly surprised to find that they...
Ronald Alford, Ugur Kuter, Dana S. Nau, Elnatan Re...
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. ...
The lack of structured methodologies and software engineering efforts on designing the support of contextawareness in pervasive systems hinders the potential advantages of analyzi...
Oriana Riva, Cristiano di Flora, Stefano Russo, Ki...
This paper presents two methods for improving the performance of the Distributed Breakout Algorithm using the notion of interchangeability. In particular, we use neighborhood part...
Many on-line (interactive) mathematics recognition systems allow the creation of typeset equations, normally in LaTeX, but they do not support mathematical problem solving. In thi...
George Labahn, Edward Lank, Scott MacLean, Mirette...