Sciweavers

1469 search results - page 181 / 294
» A New Migration Model For Distributed Genetic Algorithms
Sort
View
PODC
2006
ACM
14 years 2 months ago
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
EUROSIM
1994
13 years 9 months ago
Pact: An Environment for Parallel Heuristic Programming
This paper introduces Pact, a new model for parallel heuristic programming on MIMD machines. Designed and implemented as an integrated tool environment, Pact allows the user to dev...
Marc Aguilar, Béat Hirsbrunner
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 2 months ago
Screening the parameters affecting heuristic performance
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
Enda Ridge, Daniel Kudenko
CP
2003
Springer
14 years 1 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
LATIN
2004
Springer
14 years 1 months ago
On the Competitiveness of AIMD-TCP within a General Network
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...
Jeff Edmonds