Sciweavers

670 search results - page 28 / 134
» Brain-Like Approximate Reasoning
Sort
View
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
14 years 8 months ago
Simulation-based LQR-trees with input and state constraints
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
Philipp Reist, Russ Tedrake
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
14 years 9 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
TCOM
2010
92views more  TCOM 2010»
14 years 4 months ago
UWB receiver designs based on a gaussian-laplacian noise-plus-MAI model
Two novel receiver structures which surpass the performance of the conventional matched filter receiver are proposed for ultra-wide bandwidth multiple access communications. The pr...
Norman C. Beaulieu, Somasundaram Niranjayan
FUIN
2010
143views more  FUIN 2010»
14 years 7 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
FLAIRS
2007
15 years 11 days ago
Dynamic DDN Construction for Lightweight Planning Architectures
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
William H. Turkett