Sciweavers

6437 search results - page 1149 / 1288
» Parallel Algorithms for Arrangements
Sort
View
DEBS
2007
ACM
15 years 4 months ago
Modeling the communication costs of content-based routing: the case of subscription forwarding
Content-based routing (CBR) provides the core distribution support of several middleware paradigms, most notably content-based publish-subscribe. Despite its popularity, however, ...
Stefano Castelli, Paolo Costa, Gian Pietro Picco
ICDCS
2010
IEEE
15 years 4 months ago
Stochastic Steepest-Descent Optimization of Multiple-Objective Mobile Sensor Coverage
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
105
Voted
ICDCS
2010
IEEE
15 years 4 months ago
Sentomist: Unveiling Transient Sensor Network Bugs via Symptom Mining
—Wireless Sensor Network (WSN) applications are typically event-driven. While the source codes of these applications may look simple, they are executed with a complicated concurr...
Yangfan Zhou, Xinyu Chen, Michael R. Lyu, Jiangchu...
92
Voted
PODC
2010
ACM
15 years 4 months ago
Optimal gradient clock synchronization in dynamic networks
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rote...
103
Voted
PODC
2010
ACM
15 years 4 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
« Prev « First page 1149 / 1288 Last » Next »