Sciweavers

791 search results - page 156 / 159
» Approximating the Maximum Sharing Problem
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
A Queueing Model Framework of PCE-Based Inter-Area Path Computation
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...
DMSN
2007
ACM
13 years 11 months ago
Similarity-aware query allocation in sensor networks with multiple base stations
In this paper, we consider a large scale sensor network comprising multiple, say K, base stations and a large number of wireless sensors. Such an infrastructure is expected to be ...
Shili Xiang, Hock-Beng Lim, Kian-Lee Tan, Yongluan...
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 7 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...
ICRA
2008
IEEE
136views Robotics» more  ICRA 2008»
14 years 2 months ago
Modeling multi-robot interaction using generalized occupancy grids, with application to reducing spatial interference
— As part of a program to find methods of reducing spatial interference in multi-robot systems, we propose the Interaction Grid (IG), a generalization of the Occupancy Grid that...
Mauricio Zuluaga, Richard T. Vaughan
BMCBI
2006
112views more  BMCBI 2006»
13 years 7 months ago
A correlated motif approach for finding short linear motifs from protein interaction networks
Background: An important class of interaction switches for biological circuits and disease pathways are short binding motifs. However, the biological experiments to find these bin...
Soon-Heng Tan, Hugo Willy, Wing-Kin Sung, See-Kion...