Sciweavers

450 search results - page 55 / 90
» Adaptive Algorithms for Online Decision Problems
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Winnowing subspaces
We generalize the Winnow algorithm for learning disjunctions to learning subspaces of low rank. Subspaces are represented by symmetric projection matrices. The online algorithm ma...
Manfred K. Warmuth
GECCO
2004
Springer
142views Optimization» more  GECCO 2004»
14 years 1 months ago
Improving MACS Thanks to a Comparison with 2TBNs
Abstract. Factored Markov Decision Processes is the theoretical framework underlying multi-step Learning Classifier Systems research. This framework is mostly used in the context ...
Olivier Sigaud, Thierry Gourdin, Pierre-Henri Wuil...
IBMRD
2006
58views more  IBMRD 2006»
13 years 8 months ago
Self-adapting numerical software (SANS) effort
The challenge for the development of next generation software is the successful management of the complex computational environment while delivering to the scientist the full powe...
Jack Dongarra, George Bosilca, Zizhong Chen, Victo...
WIA
2005
Springer
14 years 1 months ago
Minimization of Non-deterministic Automata with Large Alphabets
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, Ma...
DASFAA
2005
IEEE
157views Database» more  DASFAA 2005»
14 years 1 months ago
Adaptively Detecting Aggregation Bursts in Data Streams
Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the p...
Aoying Zhou, Shouke Qin, Weining Qian