2926 search results - page 70 / 586 » Partially Optimal Routing |
91
Voted
PDCAT
2007
Springer
15 years 6 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
113
Voted
ADHOCNOW
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The resource limited nature of WSNs require that protocols implemented on these networks be energy-efficient, scalable and distributed. This paper presents an analysis of...
97
Voted
MOBICOM
2006
ACM
15 years 6 months ago
2006
ACM
We propose novel solutions for unicast routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic i...
104
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
104
click to vote
CIMCA
2005
IEEE
15 years 6 months ago
2005
IEEE
Research on the optimization of Vehicle Routing Problem with Time Windows (VRPTW) is a significant investigation area of ant colony system (ACS). This paper proposes an enhanced AC...