Sciweavers

12950 search results - page 590 / 2590
» On Optimal Timed Strategies
Sort
View
LCTRTS
1998
Springer
15 years 11 months ago
Automatic Accurate Time-Bound Analysis for High-Level Languages
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence ...
Yanhong A. Liu, Gustavo Gomez
CJ
2010
128views more  CJ 2010»
15 years 7 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...
APIN
2006
207views more  APIN 2006»
15 years 7 months ago
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
The Vehicle Routing Problem with Time windows (VRPTW) is an extension of the capacity constrained Vehicle Routing Problem (VRP). The VRPTW is NP-Complete and instances with 100 cus...
Beatrice M. Ombuki, Brian Ross, Franklin Hanshar
DM
2002
104views more  DM 2002»
15 years 7 months ago
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
Brigitte Servatius, Herman Servatius
TIT
2002
64views more  TIT 2002»
15 years 7 months ago
An information-theoretic and game-theoretic study of timing channels
This paper focuses on jammed timing channels. Pure delay jammers with a maximum delay constraint, an average delay constraint, or a maximum buffer size constraint are explored, for...
James Giles, Bruce Hajek