778 search results - page 88 / 156 » Bounding Smooth Integers |
163
click to vote
CORR
2007
Springer
15 years 4 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...
141
Voted
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
159
click to vote
INFOCOM
1998
IEEE
15 years 8 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
154
click to vote
DAM
2007
15 years 4 months ago
2007
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
149
click to vote
JACM
2007
15 years 4 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...