14548 search results - page 396 / 2910 » The Optimal Path-Matching Problem |
193
click to vote
GECCO
2004
Springer
16 years 4 days ago
2004
Springer
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
166
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative ...
239
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
165
click to vote
AIPS
2006
15 years 8 months ago
2006
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
165
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...