7228 search results - page 213 / 1446 » From Algorithmic to Subjective Randomness |
164
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
145
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
124
click to vote
CSL
2006
Springer
15 years 7 months ago
2006
Springer
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
126
click to vote
NETWORKING
2007
15 years 5 months ago
2007
Recently, Doubletree, a cooperative algorithm for large-scale topology discovery at the IP level, was introduced. Compared to classic probing systems, Doubletree discovers almost a...
140
click to vote
MP
1998
15 years 3 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...