Sciweavers

1205 search results - page 164 / 241
» On P Systems with Bounded Parallelism
Sort
View
OPODIS
2010
13 years 5 months ago
An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
Danny Hendler, Shay Kutten, Erez Michalak
IFIP
2004
Springer
14 years 1 months ago
PolyA: True Type Polymorphism for Mobile Ambients
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems) offer lit...
Torben Amtoft, Henning Makholm, J. B. Wells
ESCIENCE
2007
IEEE
14 years 2 months ago
A SLA-Oriented Management of Containers for Hosting Stateful Web Services
Service-Oriented Architectures provide integration of interoperability for independent and loosely coupled services. Web services and the associated new standards such as WSRF are...
Christoph Reich, Kris Bubendorfer, Matthias Banhol...
ICDCS
2007
IEEE
14 years 2 months ago
Differentiated Data Persistence with Priority Random Linear Codes
Both peer-to-peer and sensor networks have the fundamental characteristics of node churn and failures. Peers in P2P networks are highly dynamic, whereas sensors are not dependable...
Yunfeng Lin, Baochun Li, Ben Liang
ICPP
2007
IEEE
14 years 2 months ago
Difficulty-aware Hybrid Search in Peer-to-Peer Networks
—By combining an unstructured protocol with a DHT-based global index, hybrid peer-to-peer (P2P) improves search efficiency in terms of query recall and response time. The major c...
Hanhua Chen, Hai Jin, Yunhao Liu, Lionel M. Ni