840 search results - page 84 / 168 » Inapproximability of Combinatorial Optimization Problems |
88
Voted
BIOINFORMATICS
2007
15 years 17 days ago
2007
Primer approximation multiplex PCR (PAMP) is a new experimental protocol for efficiently assaying structural variation in genomes. PAMP is particularly suited to cancer genomes w...
146
click to vote
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
131
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
116
click to vote
ACSC
2005
IEEE
15 years 6 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
99
Voted
ENGL
2008
15 years 16 days ago
2008
This paper discusses novel dedicated hardware architecture for hybrid optimization based on Genetic algorithm (GA) and Simulated Annealing (SA). The proposed architecture achieves ...