Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
This paper presents findings from a longitudinal field study of web-design undertaken in a webdevelopment company. The main contribution is a comparison of some early predictions ...
Shape from Shading (SFS) is one of the most extensively studied problems in Computer Vision. However, most of the approaches only deal with Lambertian or other specific shading mo...
The Internet and Intranet reduce much of the costs of information sharing, but they do not solve receivers' reading and interpretation limitations. Alternatively, browsers an...