Sciweavers

495 search results - page 36 / 99
» Learning to generalize for complex selection tasks
Sort
View
ATAL
2009
Springer
14 years 3 months ago
Solving multiagent assignment Markov decision processes
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
Scott Proper, Prasad Tadepalli
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 8 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
AGENTS
1997
Springer
14 years 19 days ago
Learning View Graphs for Robot Navigation
Abstract. We present a purely vision-based scheme for learning a topological representation of an open environment. The system represents selected places by local views of the surr...
Matthias O. Franz, Bernhard Schölkopf, Philip...
UAI
2008
13 years 10 months ago
Projected Subgradient Methods for Learning Sparse Gaussians
Gaussian Markov random fields (GMRFs) are useful in a broad range of applications. In this paper we tackle the problem of learning a sparse GMRF in a high-dimensional space. Our a...
John Duchi, Stephen Gould, Daphne Koller
IPSN
2010
Springer
14 years 3 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause