Sciweavers

10670 search results - page 2005 / 2134
» Required Information Release
Sort
View
FSTTCS
2004
Springer
15 years 7 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
IPSN
2004
Springer
15 years 7 months ago
The impact of spatial correlation on routing with compression in wireless sensor networks
The efficacy of data aggregation in sensor networks is a function of the degree of spatial correlation in the sensed phenomenon. While several data aggregation (i.e., routing with...
Sundeep Pattem, Bhaskar Krishnamachari, Ramesh Gov...
IWQOS
2004
Springer
15 years 7 months ago
Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks
— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes...
Theodoros Salonidis, Leandros Tassiulas
LSGRID
2004
Springer
15 years 7 months ago
Grid Portal Interface for Interactive Use and Monitoring of High-Throughput Proteome Annotation
High-throughput proteome annotation refers to the activity of extracting information from all proteins in a particular organism using bioinformatics software on a high performance ...
Atif Shahab, Danny Chuon, Toyotaro Suzumura, Wilfr...
MATES
2004
Springer
15 years 7 months ago
Paraconsistent Assertions
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an exp...
Jørgen Villadsen
« Prev « First page 2005 / 2134 Last » Next »