Sciweavers

27692 search results - page 233 / 5539
» Where is ...
Sort
View
IDEAL
2000
Springer
14 years 2 months ago
Observational Learning with Modular Networks
Observational learning algorithm is an ensemble algorithm where each network is initially trained with a bootstrapped data set and virtual data are generated from the ensemble for ...
Hyunjung Shin, Hyoungjoo Lee, Sungzoon Cho
FOCS
1995
IEEE
14 years 2 months ago
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
Noga Alon, Jeff Edmonds, Michael Luby
AIPS
2010
14 years 1 months ago
The Joy of Forgetting: Faster Anytime Search via Restarting
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml
AAAI
2008
14 years 1 months ago
Exposing Parameters of a Trained Dynamic Model for Interactive Music Creation
As machine learning (ML) systems emerge in end-user applications, learning algorithms and classifiers will need to be robust to an increasingly unpredictable operating environment...
Dan Morris, Ian Simon, Sumit Basu
AIPS
2008
14 years 1 months ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell