Sciweavers

8315 search results - page 1526 / 1663
» Performance Evaluation for Global Computation
Sort
View
AAAI
2010
15 years 7 months ago
Searching Without a Heuristic: Efficient Use of Abstraction
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
Bradford John Larsen, Ethan Burns, Wheeler Ruml, R...
AICT
2008
IEEE
119views Communications» more  AICT 2008»
15 years 6 months ago
Simplification of Frequency Test for Random Number Generation Based on Chi-Square
This paper presents the simplified method of random test suite based on the frequency (block) test. The test is used to check the first property of random numbers which is to have ...
Kruawan Wongpanya, Keattisak Sripimanwat, Kanok Je...
JAIR
2008
126views more  JAIR 2008»
15 years 6 months ago
Optimal and Approximate Q-value Functions for Decentralized POMDPs
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
Frans A. Oliehoek, Matthijs T. J. Spaan, Nikos A. ...
ICDCS
2009
IEEE
15 years 4 months ago
Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
Meijia Hou, Dan Wang, Mingwei Xu, Jiahai Yang
AI
2011
Springer
15 years 1 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
« Prev « First page 1526 / 1663 Last » Next »