5115 search results - page 447 / 1023 » On Randomized Lanczos Algorithms |
209
click to vote
CIAC
2006
Springer
15 years 11 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
209
click to vote
SODA
2008
ACM
15 years 9 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
275
click to vote
EUROGP
2010
Springer
16 years 2 months ago
2010
Springer
We consider the validation of randomly generated patterns in a Monte-Carlo Tree Search program. Our bandit-based genetic programming (BGP) algorithm, with proved mathematical prope...
284
click to vote
COMPGEOM
2010
ACM
16 years 21 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
195
click to vote
CONCUR
2006
Springer
15 years 11 months ago
2006
Springer
We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our su...