Sciweavers

42230 search results - page 85 / 8446
» Algorithms and Complexity Results for
Sort
View
AAAI
2012
13 years 6 days ago
Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning
It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and...
Blai Bonet, Hector Geffner
CVPR
2004
IEEE
15 years 11 months ago
Efficient Search of Faces from Complex Line Drawings
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
Jianzhuang Liu, Xiaoou Tang
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
15 years 7 months ago
On the Exact Space Complexity of Sketching and Streaming Small Norms
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
ROBOCUP
2007
Springer
153views Robotics» more  ROBOCUP 2007»
15 years 3 months ago
Model-Based Reinforcement Learning in a Complex Domain
Reinforcement learning is a paradigm under which an agent seeks to improve its policy by making learning updates based on the experiences it gathers through interaction with the en...
Shivaram Kalyanakrishnan, Peter Stone, Yaxin Liu
APAL
2004
105views more  APAL 2004»
14 years 9 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek