Sciweavers

232 search results - page 33 / 47
» Active Learning in the Non-realizable Case
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 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
CP
2000
Springer
14 years 2 months ago
Constraint-Based Agents: The ABC's of CBA's
The Constraint-Based Agent (CBA) framework is a set of tools for designing, simulating, building, verifying, optimizing, learning and debugging controllers for agents embedded in a...
Alan K. Mackworth
ECSCW
2003
13 years 11 months ago
Learning and Living in the 'New office'
‘Knowledge sharing’ and ‘learning’ are terms often connected with the ‘New office’, the “modern” open office space. Work in these settings becomes more and more dis...
Eva Bjerrum, Susanne Bødker
FMSD
2008
110views more  FMSD 2008»
13 years 10 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
BC
2002
91views more  BC 2002»
13 years 9 months ago
Mathematical formulations of Hebbian learning
Several formulations of correlation-based Hebbian learning are reviewed. On the presynaptic side, activity is described either by a firing rate or by presynaptic spike arrival. The...
Wulfram Gerstner, Werner M. Kistler