Sciweavers

794 search results - page 78 / 159
» Improved algorithms for orienteering and related problems
Sort
View
ATAL
2010
Springer
13 years 10 months ago
Point-based policy generation for decentralized POMDPs
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
ICML
2005
IEEE
14 years 9 months ago
Reinforcement learning with Gaussian processes
Gaussian Process Temporal Difference (GPTD) learning offers a Bayesian solution to the policy evaluation problem of reinforcement learning. In this paper we extend the GPTD framew...
Yaakov Engel, Shie Mannor, Ron Meir
INCDM
2007
Springer
69views Data Mining» more  INCDM 2007»
14 years 3 months ago
Simultaneous Co-clustering and Modeling of Market Data
For difficult prediction problems, practitioners often segment the data into relatively homogenous groups and then build a model for each group. This two-step procedure usually res...
Meghana Deodhar, Joydeep Ghosh
CVPR
2010
IEEE
14 years 5 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
ACL
2006
13 years 10 months ago
Semantic Taxonomy Induction from Heterogenous Evidence
We propose a novel algorithm for inducing semantic taxonomies. Previous algorithms for taxonomy induction have typically focused on independent classifiers for discovering new sin...
Rion Snow, Daniel Jurafsky, Andrew Y. Ng