209 search results - page 30 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
86
Voted
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory (TM) promises to alle...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
104
Voted
CISS
2007
IEEE
15 years 1 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
105
click to vote
PODC
1989
ACM
15 years 1 months ago
1989
ACM
Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Effi...