4377 search results - page 296 / 876 » Mass problems and randomness |
138
click to vote
MST
2008
15 years 6 months ago
2008
Abstract The transformation protocol can allow two players to share an unconditionally secure secret key using a random deal of cards. A sufficient condition on the number of cards...
186
click to vote
ANOR
2002
15 years 6 months ago
2002
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
182
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
200
click to vote
RSA
2010
15 years 5 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
159
click to vote
SIGACT
2010
15 years 5 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...