14649 search results - page 336 / 2930 » Principles of problem solving |
213
click to vote
EVOW
2011
Springer
2011
Springer
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
14 years 10 months ago
The traveling salesman problem with time windows is known to be a really difficult benchmark for optimization algorithms. In this paper, we are interested in the minimization of th...
161
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
159
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
173
click to vote
GMP
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper summarizes a series of recent research results made at Edinburgh University based on projects that apply domain knowledge of standard shapes and relationships to solve ...
223
Voted
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Biogeography-based optimization (BBO) is a new evolutionary algorithm based on the science of biogeography. We propose two extensions to BBO. First, we propose blended migration. ...