4313 search results - page 4 / 863 » Using time travel to diagnose computer problems |
107
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...
SRDS
2008
IEEE
15 years 4 months ago
2008
IEEE
Replicated file-systems can experience degraded performance that might not be adequately handled by the underlying fault-tolerant protocols. We describe the design and implementa...
101
click to vote
ICICIC
2006
IEEE
15 years 3 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
EOR
2010
14 years 4 months ago
2010
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...