4565 search results - page 4 / 913 » Time Optimal Self-Stabilizing Algorithms |
ICPADS
2006
IEEE
14 years 8 days ago
2006
IEEE
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
ICPADS
2002
IEEE
13 years 11 months ago
2002
IEEE
Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. It is a lightweight and efficient method of routing message...
EVOW
2011
Springer
2011
Springer
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
12 years 9 months ago
The traveling salesman problem with time windows is known to be a really difficult benchmark for optimization algorithms. In this paper, we are interested in the minimization of th...
ICFEM
2009
Springer
13 years 4 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
JCIT
2010
13 years 1 months ago
2010
The complicated interactions among tasks lead to iterations in product design and development. To maintain the market share, enterprises should effectively manage their product de...