Sciweavers

1205 search results - page 95 / 241
» On P Systems with Bounded Parallelism
Sort
View
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
14 years 4 months ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
ICPP
1998
IEEE
14 years 1 months ago
A Real-Time Communication Method for Wormhole Switching Networks
In this paper, we propose a real-time communication scheme that can be used in general point-to-point real-time multicomputer systems with wormhole switching. Real-time communicat...
Byungjae Kim, Jong Kim, Sung Je Hong, Sunggu Lee
DEBS
2007
ACM
14 years 2 months ago
The arbitrary Boolean publish/subscribe model: making the case
In this paper, we present BoP, a content-based publish/subscribe system for arbitrary Boolean subscriptions and advertisements. BoP targets at the time and space-efficient matchin...
Sven Bittner, Annika Hinze
ISPAN
2005
IEEE
14 years 3 months ago
Overlay networks with class
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...
SIGMETRICS
2005
ACM
147views Hardware» more  SIGMETRICS 2005»
14 years 3 months ago
Denial-of-service resilience in peer-to-peer file sharing systems
Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. Th...
Dan Dumitriu, Edward W. Knightly, Aleksandar Kuzma...