Sciweavers

147 search results - page 16 / 30
» How an optimal observer can collapse the search space
Sort
View
UAI
1997
13 years 9 months ago
A Bayesian Approach to Learning Bayesian Networks with Local Structure
Recently several researchers have investigated techniques for using data to learn Bayesian networks containing compact representations for the conditional probability distribution...
David Maxwell Chickering, David Heckerman, Christo...
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 15 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
ICML
1999
IEEE
14 years 8 months ago
Implicit Imitation in Multiagent Reinforcement Learning
Imitation is actively being studied as an effective means of learning in multi-agent environments. It allows an agent to learn how to act well (perhaps optimally) by passively obs...
Bob Price, Craig Boutilier
WWW
2005
ACM
14 years 8 months ago
A search engine for natural language applications
Many modern natural language-processing applications utilize search engines to locate large numbers of Web documents or to compute statistics over the Web corpus. Yet Web search e...
Michael J. Cafarella, Oren Etzioni
ICDCS
2010
IEEE
13 years 11 months ago
Stochastic Steepest-Descent Optimization of Multiple-Objective Mobile Sensor Coverage
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...