Sciweavers

12264 search results - page 206 / 2453
» Analysis of the rubberband algorithm
Sort
View
SPAA
2000
ACM
15 years 11 months ago
An experimental study of a simple, distributed edge coloring algorithm
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
Madhav V. Marathe, Alessandro Panconesi, Larry D. ...
ATVA
2006
Springer
106views Hardware» more  ATVA 2006»
15 years 10 months ago
Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier E...
ICTAI
2005
IEEE
16 years 4 days ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet
HVC
2005
Springer
112views Hardware» more  HVC 2005»
15 years 12 months ago
Dynamic Deadlock Analysis of Multi-threaded Programs
This paper presents a dynamic program analysis algorithm that can detect deadlock potentials in a multi-threaded program by examining a single execution trace, obtained by running ...
Saddek Bensalem, Klaus Havelund
CHES
1999
Springer
140views Cryptology» more  CHES 1999»
15 years 10 months ago
Power Analysis Attacks of Modular Exponentiation in Smartcards
Abstract. Three new types of power analysis attacks against smartcard implementations of modular exponentiation algorithms are described. The first attack requires an adversary to ...
Thomas S. Messerges, Ezzy A. Dabbish, Robert H. Sl...