Sciweavers

2924 search results - page 463 / 585
» Lower Bounds in Distributed Computing
Sort
View
LOGCOM
2006
90views more  LOGCOM 2006»
15 years 4 months ago
ATL Satisfiability is Indeed EXPTIME-complete
The Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems ...
Dirk Walther, Carsten Lutz, Frank Wolter, Michael ...
ICNP
2009
IEEE
15 years 11 months ago
oCast: Optimal Multicast Routing Protocol for Wireless Sensor Networks
—In this paper, we describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermitten...
Lu Su, Bolin Ding, Yong Yang, Tarek F. Abdelzaher,...
CONCUR
2007
Springer
15 years 10 months ago
Causal Message Sequence Charts
Scenario languages based on Message Sequence Charts (MSCs) have been widely studied in the last decade [21,20,3,15,12,19,14]. The high expressive power of MSCs renders many basic ...
Thomas Gazagnaire, Blaise Genest, Loïc H&eacu...
SIROCCO
2000
15 years 5 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...
GRID
2004
Springer
15 years 10 months ago
Grid-based Indexing of a Newswire Corpus
In this paper we report experience in the use of computational grids in the domain of natural language processing, particularly in the area of information extraction, to create qu...
Baden Hughes, Srikumar Venugopal, Rajkumar Buyya