9949 search results - page 382 / 1990 » On the Network Complexity of Selection |
176
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
207
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Recent technology trends in the Web Services (WS) domain indicate that a solution eliminating the presumed complexity of the WS-* standards may be in sight: advocates of REpresent...
172
click to vote
ICDCS
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
219
click to vote
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
182
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...