Sciweavers

388 search results - page 68 / 78
» Learning to Optimize Plan Execution in Information Agents
Sort
View
ATAL
2006
Springer
13 years 11 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
AAAI
2006
13 years 9 months ago
Action Selection in Bayesian Reinforcement Learning
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
Tao Wang
VLDB
2007
ACM
134views Database» more  VLDB 2007»
14 years 1 months ago
Building Structured Web Community Portals: A Top-Down, Compositional, and Incremental Approach
Structured community portals extract and integrate information from raw Web pages to present a unified view of entities and relationships in the community. In this paper we argue...
Pedro DeRose, Warren Shen, Fei Chen 0002, AnHai Do...
AAAI
1998
13 years 8 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
AAAI
2008
13 years 9 months ago
Semi-Supervised Ensemble Ranking
Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance b...
Steven C. H. Hoi, Rong Jin