2434 search results - page 47 / 487 » Algorithmic Randomness of Closed Sets |
110
click to vote
APPROX
2000
Springer
15 years 6 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
129
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
100
click to vote
ISAAC
1999
Springer
15 years 6 months ago
1999
Springer
We study the online problem of holding a number of idle threads on an application server, which we have ready for processing new requests. The problem stems from the fact that bot...
116
click to vote
CSR
2006
Springer
15 years 5 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
101
click to vote
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...