— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
Field-based coordination is a very promising approach for a wide range of application scenarios in modern dynamic networks. To implement such an approach, one can rely on distribu...
Speculative pre-execution is a promising prefetching technique which uses an auxiliary assisting thread in addition to the main program flow. A prefetching thread (p-thread), whic...
This paper discusses the architecture and implementation of dynamic web-based surveys with an emphasis on the recently completed Survey2001 project. Survey2001 was made available ...
Roy P. Pargas, James C. Witte, Kowshik Jaganathan,...
We present an optimized parallelization scheme for molecular dynamics simulations of large biomolecular systems, implemented in the production-quality molecular dynamics program N...
Robert Brunner, James C. Phillips, Laxmikant V. Ka...