Sciweavers

805 search results - page 18 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
CEC
2007
IEEE
14 years 4 months ago
On improving approximate solutions by evolutionary algorithms
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank ...
CORR
2011
Springer
177views Education» more  CORR 2011»
13 years 4 months ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi
IWANN
2005
Springer
14 years 3 months ago
A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
Carlos Cotta
ISCAS
2005
IEEE
149views Hardware» more  ISCAS 2005»
14 years 3 months ago
Advances in QoS path(s) selection problem
— In this paper we provide a survey of three classes of combinatorial optimization problems that arise in communication network analysis. These problems, referred to as QoS (Qual...
Krishnaiyan Thulasiraman, Ying Xiao, Guoliang Xue
IRREGULAR
1995
Springer
14 years 1 months ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...