Sciweavers

5615 search results - page 942 / 1123
» On the Computational Capabilities of Several Models
Sort
View
ECML
2005
Springer
16 years 20 days ago
Using Rewards for Belief State Updates in Partially Observable Markov Decision Processes
Partially Observable Markov Decision Processes (POMDP) provide a standard framework for sequential decision making in stochastic environments. In this setting, an agent takes actio...
Masoumeh T. Izadi, Doina Precup
FOSSACS
2005
Springer
16 years 20 days ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle
FROCOS
2005
Springer
16 years 20 days ago
Combination of Isabelle/HOL with Automatic Tools
We describe results and status of a sub project of the Verisoft [1] project. While the Verisoft project aims at verification of a complete computer system starting with hardware a...
Sergey Tverdyshev
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
16 years 20 days ago
Terrain generation using genetic algorithms
We propose a method for applying genetic algorithms to create 3D terrain data sets. Existing procedural algorithms for generation of terrain have several shortcomings. The most po...
TeongJoo Ong, Ryan Saunders, John Keyser, John J. ...
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
16 years 19 days ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...