361 search results - page 50 / 73 » Ant Colony Optimization |
ASPDAC
2007
ACM
14 years 1 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
DICS
2006
14 years 1 months ago
2006
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
HEURISTICS
2006
13 years 10 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
ANTSW
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Ant algorithms are usually derived from a stochastic modeling based on some specific probability laws. We consider in this paper a full deterministic model of "logis...
KBSE
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—Decisions regarding the mapping of software components to hardware nodes affect the quality of the resulting system. Making these decisions is hard when considering the ...