14548 search results - page 353 / 2910 » The Optimal Path-Matching Problem |
180
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
151
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
176
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
188
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The Frequency Assignment Problem (FAP) is one of the key issues in the design of GSM networks (Global System for Mobile communications), and will remain important in the foreseeab...
185
click to vote
ESA
2010
Springer
15 years 6 months ago
2010
Springer
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...