173 search results - page 5 / 35 » random 1999 |
104
Voted
FSTTCS
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
COMBINATORICS
1999
14 years 10 months ago
1999
We prove that the threshold for a random graph to have a k-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being k-critical. 1...
HIPC
1999
Springer
15 years 2 months ago
1999
Springer
An analytical framework for modeling the performance of a single TCP session in the presence of random packet loss is presented that is based on a semi-Markov model for the window ...
WG
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
75
Voted
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper deals with balls and bins processes related to randomized load balancing, dynamic resource allocation, and hashing. Suppose