Sciweavers

1047 search results - page 15 / 210
» Learning the required number of agents for complex tasks
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
13 years 11 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
AAAI
2011
12 years 7 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
KCAP
2009
ACM
14 years 2 months ago
Interactively shaping agents via human reinforcement: the TAMER framework
As computational learning agents move into domains that incur real costs (e.g., autonomous driving or financial investment), it will be necessary to learn good policies without n...
W. Bradley Knox, Peter Stone
ATAL
2001
Springer
14 years 5 days ago
A Stable and Feasible Payoff Division for Coalition Formation in a Class of Task Oriented Domains
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
María-Victoria Belmonte, Ricardo Conejo, Jo...
AAAI
2006
13 years 9 months ago
A Unified Cognitive Architecture for Physical Agents
In this paper we describe Icarus, a cognitive architecture for physical agents that integrates ideas from a number of traditions, but that has been especially influenced by result...
Pat Langley, Dongkyu Choi