Sciweavers

2808 search results - page 175 / 562
» Routing betweenness centrality
Sort
View
IEAAIE
2009
Springer
15 years 4 months ago
Plan Repair in Conflict-Free Routing
In conflict-free routing a set of agents have to traverse a common infrastructure without interfering with each other. Maza and Castagna [1] showed how route plans can be repaired ...
Adriaan ter Mors, Cees Witteveen
GLOBECOM
2010
IEEE
15 years 3 months ago
Circulant-Graph-Based Fault-Tolerant Routing for All-Optical WDM LANs
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
Dexiang Wang, Janise McNair
ADHOCNOW
2011
Springer
14 years 10 months ago
Joint Duty Cycle Scheduling, Resource Allocation and Multi-constrained QoS Routing Algorithm
Wireless mesh sensor networks (WMSNs) have recently gained a lot of interest due to their communication capability to support various applications with different Quality of Service...
Jamila Ben Slimane, Yeqiong Song, Anis Koubaa, Mou...
ECCC
2007
147views more  ECCC 2007»
15 years 6 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
CEC
2009
IEEE
16 years 1 months ago
Improved memetic algorithm for Capacitated Arc Routing Problem
— Capacitated Arc Routing Problem (CARP) has attracted much interest because of its wide applications in the real world. Recently, a memetic algorithm proposed by Lacomme et al. ...
Yi Mei, Ke Tang, Xin Yao