Sciweavers

315 search results - page 56 / 63
» Simple Distributed Weighted Matchings
Sort
View
CCGRID
2005
IEEE
14 years 1 months ago
Efficient resource description and high quality selection for virtual grids
Simple resource specification, resource selection, and effective binding are critical capabilities for Grid middleware. We the Virtual Grid, an abstraction for dynamic grid applic...
Yang-Suk Kee, D. Logothetis, Richard Y. Huang, Hen...
EKAW
2004
Springer
14 years 1 months ago
Generating and Integrating Evidence for Ontology Mappings
For more than a decade, ontologies have been proposed as a means to enable sharing and reuse of knowledge. While originally relatively narrow information landscapes have been in mi...
Ludger van Elst, Malte Kiesel
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
SPAA
2003
ACM
14 years 26 days ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
14 years 13 days ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu