Sciweavers

10054 search results - page 210 / 2011
» On the Complexity of Function Learning
Sort
View
129
Voted
JACM
2002
122views more  JACM 2002»
15 years 2 months ago
Cosmological lower bound on the circuit complexity of a small problem in logic
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
Larry J. Stockmeyer, Albert R. Meyer
COLT
2003
Springer
15 years 8 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
ICANN
2003
Springer
15 years 8 months ago
Self-Organizing Operator Maps in Complex System Analysis
Abstract. The growth in amount of data available today has encouraged the development of effective data analysis methods to support human decision-making. Neuro-fuzzy computation ...
Pasi Lehtimäki, Kimmo Raivio, Olli Simula
FLAIRS
2003
15 years 4 months ago
Learning Opening Strategy in the Game of Go
In this paper, we present an experimental methodology and results for a machine learning approach to learning opening strategy in the game of Go, a game for which the best compute...
Timothy Huang, Graeme Connell, Bryan McQuade
BMCBI
2010
160views more  BMCBI 2010»
15 years 3 months ago
Identification of functional hubs and modules by converting interactome networks into hierarchical ordering of proteins
Background: Protein-protein interactions play a key role in biological processes of proteins within a cell. Recent high-throughput techniques have generated protein-protein intera...
Young-Rae Cho, Aidong Zhang