Sciweavers

283 search results - page 46 / 57
» Abstracting Reusable Cases from Reinforcement Learning
Sort
View
89
Voted
IPPS
2010
IEEE
14 years 7 months ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
FOCS
1995
IEEE
15 years 1 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
AAAI
2006
14 years 11 months ago
MedEthEx: A Prototype Medical Ethics Advisor
As part of a larger Machine Ethics Project, we are developing an ethical advisor that provides guidance to health care workers faced with ethical dilemmas. MedEthEx is an implemen...
Michael Anderson, Susan Leigh Anderson, Chris Arme...
AI
2007
Springer
14 years 9 months ago
Learning, detection and representation of multi-agent events in videos
In this paper, we model multi-agent events in terms of a temporally varying sequence of sub-events, and propose a novel approach for learning, detecting and representing events in...
Asaad Hakeem, Mubarak Shah
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass