In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
—In this paper we develop a distributed rate control algorithm for multiple-unicast-sessions when network coding is allowed. Building on our recent flow-based characterization o...
Abdallah Khreishah, Chih-Chun Wang, Ness B. Shroff
Abstract. Classical evolutionary algorithms have been extremely successful at solving certain problems. But they implement a very simple model of evolutionary biology that misses o...
This paper describes VOL2, an interactive general-purpose volume renderer based on ray casting and implemented on Pixel-Planes 5, a distributed-memory, message-passing multicomput...
Andrei State, Jonathan McAllister, Ulrich Neumann,...