2095 search results - page 301 / 419 » Improved pebbling bounds |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
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...
ENTCS
2007
13 years 10 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
TON
2008
13 years 10 months ago
2008
We study the effectiveness of automatic patching and quantify the speed of patch or alert dissemination required for worm containment. We focus on random scanning as this is repres...
TWC
2008
13 years 10 months ago
2008
Abstract-- The V-BLAST (vertical Bell Labs layered Space-Time) architecture involves independent coding/decoding per antenna (layer) with equal rate and power per antenna and a fix...
SIAMCOMP
2000
13 years 10 months ago
2000
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...