Sciweavers

5138 search results - page 400 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
16 years 28 days ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan
VTC
2006
IEEE
16 years 22 days ago
Scheduling in Cellular CDMA-TDD Networks
Abstract— In this paper different scheduling algorithms applied to cellular CDMA (code division multiple access) systems with different duplexing modes are studied. In particular...
Ellina Foutekova, Patrick Agyapong, Birendra Ghimi...
ICDCS
1999
IEEE
15 years 11 months ago
Interpreting Stale Load Information
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...
Michael Dahlin
142
Voted
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 10 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan