66 search results - page 6 / 14 » Combinatorial Approximation Algorithms for MaxCut using Rand... |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
RANDOM
2001
Springer
14 years 4 days ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...