4565 search results - page 119 / 913 » Time Optimal Self-Stabilizing Algorithms |
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
BDIM
2007
IEEE
14 years 4 months ago
2007
IEEE
— Design of Service Level Agreements (SLAs) emerges as an increasingly important discipline in business-oriented IT management. In this work, we study utility maximization of con...
CSC
2009
13 years 11 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
ATVA
2004
Springer
14 years 3 months ago
2004
Springer
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...