1310 search results - page 2 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
COR
2002
13 years 7 months ago
2002
ICONIP
2007
13 years 9 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
SAC
2004
ACM
14 years 27 days ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
ADMA
2005
Springer
2005
Springer
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
14 years 1 months ago
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...