159 search results - page 14 / 32 » Solving NP-Complete Problems With Networks of Evolutionary P... |
GECCO
2005
Springer
14 years 29 days ago
2005
Springer
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
SEMWEB
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The Web of Data is increasingly becoming an important infrastructure for such diverse sectors as entertainment, government, ecommerce and science. As a result, the robust...
ISQED
2002
IEEE
14 years 13 days ago
2002
IEEE
This paper presents a fast algorithm to optimize both the widths and lengths of power/ground networks under reliability and power dip/ground bounce constraints. The spacesizing wh...
Publication
Popular myths that cheaper memory, high-speed links and high-speed processors will solve the problem of congestion in computer networks are shown to be false. A simple definition f...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
In this paper we explore the model–building issue of multiobjective optimization estimation of distribution algorithms. We argue that model–building has some characteristics t...