840 search results - page 88 / 168 » Inapproximability of Combinatorial Optimization Problems |
118
Voted
IPPS
2010
IEEE
14 years 10 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
93
Voted
GECCO
1999
Springer
15 years 4 months ago
1999
Springer
In genetic programming a general consensus is that the population should be as large as practically possible or sensible. In this paper we examine a batch of problems of combinato...
92
Voted
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
CP
2009
Springer
15 years 7 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
114
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
Online reviews provide consumers with valuable information that guides their decisions on a variety of fronts: from entertainment and shopping to medical services. Although the pr...