Sciweavers

870 search results - page 29 / 174
» Theoretical and experimental results on the goal-plan tree p...
Sort
View
ATAL
2009
Springer
15 years 4 months ago
Adversarial search with procedural knowledge heuristic
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
Viliam Lisý, Branislav Bosanský, Mic...
AI
2006
Springer
14 years 9 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
75
Voted
ACL
2009
14 years 7 months ago
Incremental Parsing with Monotonic Adjoining Operation
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. Th...
Yoshihide Kato, Shigeki Matsubara
GECCO
2009
Springer
15 years 4 months ago
Optimal robust expensive optimization is tractable
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
70
Voted
FOCS
2006
IEEE
15 years 3 months ago
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...
Christian Borgs, Jennifer T. Chayes, Elchanan Moss...