Sciweavers

1355 search results - page 115 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
DATE
2004
IEEE
114views Hardware» more  DATE 2004»
14 years 25 days ago
Workload Characterization Model for Tasks with Variable Execution Demand
The analysis of real-time properties of an embedded system usually relies on the worst-case execution times (WCET) of the tasks to be executed. In contrast to that, in real world ...
Alexander Maxiaguine, Simon Künzli, Lothar Th...
ACL
1996
13 years 10 months ago
Another Facet of LIG Parsing
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
Pierre Boullier
CCN
2006
137views Communications» more  CCN 2006»
13 years 10 months ago
Impact of sack delay and link delay on failover performance in SCTP
The Stream Control Transmission Protocol (SCTP) was developed to support the transfer of telephony signaling over IP networks. One of the ambitions when designing SCTP was to offe...
Johan Eklund, Anna Brunstrom
SSS
2005
Springer
132views Control Systems» more  SSS 2005»
14 years 2 months ago
Self-stabilizing Mobile Node Location Management and Message Routing
We present simple algorithms for achieving self-stabilizing location management and routing in mobile ad-hoc networks. While mobile clients may be susceptible to corruption and sto...
Shlomi Dolev, Limor Lahiani, Nancy A. Lynch, Tina ...
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
14 years 6 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani