840 search results - page 54 / 168 » Inapproximability of Combinatorial Optimization Problems |
EMO
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. Topology design of enterprise networks is a hard combinatorial optimization problem. It has numerous constraints, several objectives, and a very noisy solution space. Bes...
CISS
2010
IEEE
13 years 2 months ago
2010
IEEE
— AHNs are wireless networks operating without the benefits of network infrastructure (basestations) or centralized control. AHNs working with limited spectrum perform best when...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
ASIAN
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
ISPD
1997
ACM
14 years 3 months ago
1997
ACM
— In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem, matrix synthesis problem (MSP), to model the th...