Sciweavers

5675 search results - page 891 / 1135
» Exploiting Chaos for Computation
Sort
View
AAAI
1998
15 years 8 months ago
Solving Very Large Weakly Coupled Markov Decision Processes
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...
AIPS
2000
15 years 8 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
GRAPHICSINTERFACE
2000
15 years 8 months ago
High-Quality Interactive Lumigraph Rendering Through Warping
We introduce an algorithm for high-quality, interactive light field rendering from only a small number of input images with dense depth information. The algorithm bridges the gap ...
Hartmut Schirmacher, Wolfgang Heidrich, Hans-Peter...
NC
1998
138views Neural Networks» more  NC 1998»
15 years 8 months ago
Parallel Adaptive Genetic Algorithm
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...
Leo Budin, Marin Golub, Domagoj Jakobovic
HCI
1993
15 years 8 months ago
Reducing Repetition in Graphical Editing
People producing illustrations with graphical editors often need to repeat the same steps over and over again. This paper describes five techniques that reduce the amount of repet...
David Kurlander