Sciweavers

10054 search results - page 1753 / 2011
» On the Complexity of Function Learning
Sort
View
IJCAI
2003
15 years 6 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
VMV
2001
168views Visualization» more  VMV 2001»
15 years 6 months ago
High-quality Volume Rendering of Adaptive Mesh Refinement Data
Adaptive mesh refinement (AMR) is a numerical simulation technique used in computational fluid dynamics (CFD). By using a set of nested grids of different resolutions, AMR combine...
Gunther H. Weber, Oliver Kreylos, Terry J. Ligocki...
UAI
2004
15 years 6 months ago
Annealed MAP
Maximum a Posteriori assignment (MAP) is the problem of finding the most probable instantiation of a set of variables given the partial evidence on the other variables in a Bayesi...
Changhe Yuan, Tsai-Ching Lu, Marek J. Druzdzel
133
Voted
ISCAPDCS
2003
15 years 6 months ago
Parallel Relative Debugging with Dynamic Data Structures
This paper discusses the use of “relative debugging” as a technique for locating errors in a program that has been ported or developed using evolutionary software engineering ...
David Abramson, Raphael A. Finkel, Donny Kurniawan...
VMV
2004
80views Visualization» more  VMV 2004»
15 years 6 months ago
Memory Efficient Billboard Clouds for BTF Textured Objects
Efficiently rendering highly structured models distant from the viewer constitutes a difficult task since the geometric complexity has to be reduced extremely while simultaneously...
Jan Meseth, Reinhard Klein
« Prev « First page 1753 / 2011 Last » Next »