We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
We propose a new memory model called short-term memory for managing objects on the heap. In contrast to the traditional persistent memory model for heap management, objects in sho...
Martin Aigner, Andreas Haas, Christoph M. Kirsch, ...
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
In response to changing requirements and other environmental influences, software systems are increasingly developed incrementally. Successful implementation of new features in e...
Thein Than Tun, Rod Chapman, Charles B. Haley, Rob...
Collaborative development, incremental design and revision management require the ability to compare different versions of software artifacts. There are well-established approache...
Arne Schipper, Hauke Fuhrmann, Reinhard von Hanxle...