4313 search results - page 51 / 863 » Using time travel to diagnose computer problems |
169
click to vote
COR
2000
15 years 5 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
141
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Time skewing is a compile-time optimization that can provide arbitrarily high cache hit rates for a class of iterative calculations, given a sufficient number of time steps and s...
128
click to vote
GECCO
2000
Springer
15 years 9 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
156
click to vote
CDC
2010
IEEE
15 years 19 days ago
2010
IEEE
In this paper, we address the problem of temporal synchronization of a team of mobile agents on a set of rendezvous points defined by the nodes of a bipartite network. In particula...
156
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...