Sciweavers

2376 search results - page 92 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
CEC
2003
IEEE
15 years 3 months ago
A modified ant colony algorithm for evolutionary design of digital circuits
Evolutionary computation presents a new paradigm shift in hardware design and synthesis. According to this paradigm, hardware design is pursued by deriving inspiration from biologi...
Mostafa Abd-El-Barr, Sadiq M. Sait, Bambang A. B. ...
94
Voted
SAC
2008
ACM
14 years 11 months ago
Dynamic populations in genetic algorithms
Biological populations are dynamic in both space and time, that is, the population size of a species fluctuates across their habitats over time. There are rarely any static or fix...
Zhanshan (Sam) Ma, Axel W. Krings
EVOW
2006
Springer
15 years 3 months ago
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
Yuichi Nagata
85
Voted
ICALP
2009
Springer
15 years 12 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
ICPP
1999
IEEE
15 years 3 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward