Sciweavers

136 search results - page 26 / 28
» A general heuristic for vehicle routing problems
Sort
View
TWC
2008
245views more  TWC 2008»
13 years 5 months ago
Cross-Layer Optimal Policies for Spatial Diversity Relaying in Mobile Ad Hoc Networks
In order to adapt to time-varying wireless channels, various channel-adaptive schemes have been proposed to exploit inherent spatial diversity in mobile/wireless ad hoc networks w...
Jing Ai, Alhussein A. Abouzeid, Zhenzhen Ye
MOBIHOC
2002
ACM
14 years 5 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
JSAC
2006
157views more  JSAC 2006»
13 years 5 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
ATAL
2010
Springer
13 years 6 months ago
Coalition formation with spatial and temporal constraints
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is...
Sarvapali D. Ramchurn, Maria Polukarov, Alessandro...
DAC
2009
ACM
14 years 6 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert