840 search results - page 86 / 168 » Inapproximability of Combinatorial Optimization Problems |
102
click to vote
JCC
2008
15 years 13 days ago
2008
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
125
Voted
CEC
2008
IEEE
15 years 7 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
124
click to vote
TSMC
2011
14 years 7 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
104
click to vote
IAT
2003
IEEE
15 years 5 months ago
2003
IEEE
—Ant-based algorithms or ant colony optimization (ACO) algorithms have been applied successfully to combinatorial optimization problems. More recently, Parpinelli and colleagues ...
140
click to vote
LION
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genoty...