Sciweavers

835 search results - page 156 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
WAC
2005
Springer
118views Communications» more  WAC 2005»
14 years 3 months ago
Experiments on the Automatic Evolution of Protocols Using Genetic Programming
Truly autonomic networks ultimately require self-modifying, evolving protocol software. Otherwise humans must intervene in every situation that has not been anticipated at design t...
Lidia Yamamoto, Christian F. Tschudin
ATAL
2006
Springer
14 years 2 months ago
Using CHI-scores to reward honest feedback from repeated interactions
Online communities increasingly rely on reputation information to foster cooperation and deter cheating. As rational agents can often benefit from misreporting their observations,...
Radu Jurca, Boi Faltings
MST
2000
101views more  MST 2000»
13 years 10 months ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...
PVLDB
2008
137views more  PVLDB 2008»
13 years 9 months ago
Flashing up the storage layer
In the near future, commodity hardware is expected to incorporate both flash and magnetic disks. In this paper we study how the storage layer of a database system can benefit from...
Ioannis Koltsidas, Stratis Viglas
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 10 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos