Sciweavers

198 search results - page 13 / 40
» On Extremal Cases of Hopcroft's Algorithm
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
Code-Size Minimization in Multiprocessor Real-Time Systems
— Program code size is a critical factor in determining the manufacturing cost of many embedded systems, particularly those aimed at the extremely costconscious consumer market. ...
Sanjoy K. Baruah, Nathan Fisher
DGCI
2005
Springer
14 years 2 months ago
Shape Preserving Digitization of Binary Images After Blurring
Topology is a fundamental property of shapes in pictures. Since the input for any image analysis algorithm is a digital image, which does not need to have the same topological char...
Peer Stelldinger, Ullrich Köthe
NETWORKING
2007
13 years 9 months ago
Delivery Guarantees in Predictable Disruption Tolerant Networks
This article studies disruption tolerant networks (DTNs) where each node knows the probabilistic distribution of contacts with other nodes. It proposes a framework that allows one ...
Jean-Marc François, Guy Leduc
INFOCOM
2009
IEEE
14 years 3 months ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
14 years 29 days ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro