4488 search results - page 166 / 898 » Focusing Search by Using Problem Solving Experience |
169
Voted
EVOW
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
124
Voted
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
123
Voted
AAAI
2010
15 years 5 months ago
2010
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
125
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
128
click to vote
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we present a novel segmentationinsensitive approach for mining common patterns from 2 images. We develop an algorithm using the Earth Movers Distance (EMD) framewor...