Sciweavers

239 search results - page 47 / 48
» Probabilistic Concurrent Constraint Programming
Sort
View
ADHOCNOW
2004
Springer
13 years 10 months ago
Analysis of the Information Propagation Time Among Mobile Hosts
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...
SIGSOFT
2007
ACM
14 years 5 months ago
Detection and resolution of atomicity violation in service composition
Atomicity is a desirable property that safeguards application consistency for service compositions. A service composition exhibiting this property could either complete or cancel ...
Chunyang Ye, S. C. Cheung, W. K. Chan, Chang Xu
TWC
2008
113views more  TWC 2008»
13 years 4 months ago
Capacity of opportunistic routing in multi-rate and multi-hop wireless networks
Abstract-- Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wirel...
Kai Zeng, Wenjing Lou, Hongqiang Zhai
CASES
2004
ACM
13 years 8 months ago
Providing time- and space- efficient procedure calls for asynchronous software thread integration
Asynchronous Software Thread Integration (ASTI) provides fine-grain concurrency in real-time threads by statically scheduling (integrating) code from primary threads into secondar...
Vasanth Asokan, Alexander G. Dean
WWW
2004
ACM
14 years 5 months ago
Semantic email
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
Luke McDowell, Oren Etzioni, Alon Y. Halevy, Henry...