14548 search results - page 356 / 2910 » The Optimal Path-Matching Problem |
193
click to vote
EUROGP
2010
Springer
15 years 8 months ago
2010
Springer
We propose a new framework based on Genetic Programming (GP) to automatically decompose problems into smaller and simpler tasks. The framework uses GP at two levels. At the top lev...
151
click to vote
EOR
2007
15 years 6 months ago
2007
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
195
click to vote
CCE
2004
15 years 6 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
157
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
159
click to vote
ISCAS
2006
IEEE
16 years 22 days ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...