Sciweavers

2626 search results - page 280 / 526
» The complexity of stochastic sequences
Sort
View
AAAI
2010
15 years 3 months ago
A Cross-Entropy Method that Optimizes Partially Decomposable Problems: A New Way to Interpret NMR Spectra
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
Siamak (Moshen) Ravanbakhsh, Barnabás P&oac...
CORR
2011
Springer
160views Education» more  CORR 2011»
15 years 1 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
TWC
2011
291views more  TWC 2011»
15 years 1 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...
ACL
2011
14 years 10 months ago
Learning to Win by Reading Manuals in a Monte-Carlo Framework
This paper presents a novel approach for leveraging automatically extracted textual knowledge to improve the performance of control applications such as games. Our ultimate goal i...
S. R. K. Branavan, David Silver, Regina Barzilay
JMLR
2012
13 years 9 months ago
Multi Kernel Learning with Online-Batch Optimization
In recent years there has been a lot of interest in designing principled classification algorithms over multiple cues, based on the intuitive notion that using more features shou...
Francesco Orabona, Jie Luo, Barbara Caputo