Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
Martin Wehrle, Sebastian Kupferschmid, Andreas Pod...
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations of the solid-onsolid model of statistical physics. This model has been proposed...
Networked multiplayer games must support a much wider variety of interactions than single-player games because networked games involve communication and coordination between playe...
David Pinelle, Nelson Wong, Tadeusz Stach, Carl Gu...
Background: Accurately covering the conformational space of amino acid side chains is essential for important applications such as protein design, docking and high resolution stru...
Tim Harder, Wouter Boomsma, Martin Paluszewski, Je...