401 search results - page 76 / 81 » Sparse Quasi-Random Graphs |
JPDC
2008
13 years 7 months ago
2008
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...
ATMOS
2010
13 years 6 months ago
2010
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...
TMC
2010
13 years 6 months ago
2010
—In this paper we analyze multiple wireless LAN (WLAN) traces from university and corporate campuses. In particular, we consider an important event between mobile nodes in wirele...
TOSN
2010
13 years 6 months ago
2010
Boundary recognition is an important and challenging issue in wireless sensor networks when no coordinates or distances are available. The distinction between inner and boundary n...
ADHOCNOW
2007
Springer
14 years 1 months ago
2007
Springer
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...