Sciweavers

1343 search results - page 85 / 269
» Learning Weighted Automata
Sort
View
103
Voted
ML
1998
ACM
136views Machine Learning» more  ML 1998»
15 years 8 days ago
Co-Evolution in the Successful Learning of Backgammon Strategy
Following Tesauro’s work on TD-Gammon, we used a 4000 parameter feed-forward neural network to develop a competitive backgammon evaluation function. Play proceeds by a roll of t...
Jordan B. Pollack, Alan D. Blair
99
Voted
ICRA
2010
IEEE
128views Robotics» more  ICRA 2010»
14 years 11 months ago
A game-theoretic procedure for learning hierarchically structured strategies
— This paper addresses the problem of acquiring a hierarchically structured robotic skill in a nonstationary environment. This is achieved through a combination of learning primi...
Benjamin Rosman, Subramanian Ramamoorthy
89
Voted
NIPS
2007
15 years 2 months ago
Learning to classify complex patterns using a VLSI network of spiking neurons
We propose a compact, low power VLSI network of spiking neurons which can learn to classify complex patterns of mean firing rates on–line and in real–time. The network of int...
Srinjoy Mitra, Giacomo Indiveri, Stefano Fusi
101
Voted
CBRMD
2008
69views more  CBRMD 2008»
15 years 21 days ago
Procurement Fraud Discovery using Similarity Measure Learning
Abstract. This paper describes an approach to detect hints on procurement fraud. It was developed within the context of a European Union project on fraud prevention. Procurement fr...
Stefan Rüping, Natalja Punko, Björn G&uu...
99
Voted
AAAI
1997
15 years 1 months ago
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
Tom Bylander