Sciweavers

1768 search results - page 96 / 354
» Optimal routing in Chord
Sort
View
119
Voted
GLVLSI
2007
IEEE
186views VLSI» more  GLVLSI 2007»
15 years 28 days ago
Block placement to ensure channel routability
Given a set of placed blocks, we present an algorithm that minimally spaces the blocks to ensure routability under several assumptions. By performing a binary search on total widt...
Shigetoshi Nakatake, Zohreh Karimi, Taraneh Taghav...
TON
2012
13 years 3 months ago
Some Fundamental Results on Base Station Movement Problem for Wireless Sensor Networks
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...
Yi Shi, Y. Thomas Hou
98
Voted
ICDE
2006
IEEE
190views Database» more  ICDE 2006»
15 years 6 months ago
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
Elke Michlmayr
115
Voted
ATMOS
2010
308views Optimization» more  ATMOS 2010»
14 years 11 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
104
Voted
GECCO
2009
Springer
125views Optimization» more  GECCO 2009»
15 years 5 months ago
Preserving population diversity for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
Abel Garcia-Najera