4313 search results - page 8 / 863 » Using time travel to diagnose computer problems |
IJCAI
2003
14 years 11 months ago
2003
This paper addresses the formal verification of diagnosis systems. We tackle the problem of diagnosability: given a partially observable dynamic system, and a diagnosis system obs...
121
click to vote
EVOW
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
111
click to vote
ANTSW
2010
Springer
14 years 7 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
PDCAT
2005
Springer
15 years 3 months ago
2005
Springer
This paper describes how to solve very large TravelingSalesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of para...
GI
2007
Springer
15 years 3 months ago
2007
Springer
Abstract: This paper concentrates on a new framework for a post-market reassignment of requests in a Collaborative Carrier Network (CCN). While the framework was applied to a picku...