Sciweavers

2652 search results - page 302 / 531
» Privacy-preserving linear programming
Sort
View
AAAI
2006
15 years 4 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
126
Voted
NIPS
2001
15 years 4 months ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr
WAE
2001
281views Algorithms» more  WAE 2001»
15 years 4 months ago
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
David A. Bader, Ajith K. Illendula, Bernard M. E. ...
124
Voted
WSC
2004
15 years 4 months ago
HDPS, an XML/XSLT Based Hierarchal Modeling System
HDPS is a practical system for designing modeling paradigms, creating hierarchal model definitions, and evaluating multi-paradigm models - particularly in business and finance. HD...
Richard Evan Curry, Kiriakos Vlahos
CIMAGING
2009
120views Hardware» more  CIMAGING 2009»
15 years 4 months ago
Dantzig selector homotopy with dynamic measurements
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
Muhammad Salman Asif, Justin K. Romberg