840 search results - page 75 / 168 » Inapproximability of Combinatorial Optimization Problems |
101
click to vote
ANTSW
2008
Springer
15 years 2 months ago
2008
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...
111
Voted
HIS
2008
15 years 1 months ago
2008
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This ...
133
click to vote
ISDA
2008
IEEE
15 years 6 months ago
2008
IEEE
Due to their excellent performance in solving combinatorial optimization problems, metaheuristics algorithms such as Genetic Algorithms (GA), Simulated Annealing (SA) and Tabu Sea...
103
Voted
AIPS
2006
15 years 1 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
115
click to vote
AAAI
2006
15 years 1 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...