Sciweavers

6142 search results - page 1001 / 1229
» The Complexity of Partition Functions
Sort
View
OPODIS
2004
15 years 7 months ago
Optimal Resilience Asynchronous Approximate Agreement
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
Ittai Abraham, Yonatan Amit, Danny Dolev
OPODIS
2004
15 years 7 months ago
Secure Location Verification Using Radio Broadcast
Secure location verification is a recently stated problem that has a number of practical applications. The problem requires a wireless sensor network to confirm that a potentially...
Adnan Vora, Mikhail Nesterenko
NIPS
2001
15 years 7 months ago
Algorithmic Luckiness
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
Ralf Herbrich, Robert C. Williamson
IJCAI
2003
15 years 7 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 7 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...
« Prev « First page 1001 / 1229 Last » Next »