Sciweavers

643 search results - page 91 / 129
» A browser for incremental programming
Sort
View
AI
2002
Springer
13 years 10 months ago
Parallel Randomized Best-First Minimax Search
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...
Yaron Shoham, Sivan Toledo
IWMM
2011
Springer
254views Hardware» more  IWMM 2011»
13 years 29 days ago
Short-term memory for self-collecting mutators
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, ...
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
14 years 11 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
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...
ECBS
2009
IEEE
105views Hardware» more  ECBS 2009»
14 years 4 months ago
A Framework for Developing Feature-Rich Software Systems
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...
ICECCS
2009
IEEE
106views Hardware» more  ICECCS 2009»
14 years 4 months ago
Visual Comparison of Graphical Models
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...