Sciweavers

380 search results - page 4 / 76
» Towards an Optimal Routing Strategy
Sort
View
CLUSTER
2005
IEEE
14 years 2 months ago
Toward an Optimal Redundancy Strategy for Distributed Computations
Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The related computation integrity concerns are commonly...
Doug Szajda, Barry Lawson, Jason Owen
INFOCOM
2003
IEEE
14 years 1 months ago
Optimizing Route-Cache Lifetime in Ad Hoc Networks
—On-demand routing reduces the control overhead in mobile ad hoc networks, but it has the major drawback of introducing latency between route-request arrival and the determinatio...
Ben Liang, Zygmunt J. Haas
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 7 months ago
A Stackelberg Strategy for Routing Flow over Time
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...
Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 9 months ago
A new memetic strategy for the numerical treatment of multi-objective optimization problems
In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry o...
Oliver Schütze, Gustavo Sanchez, Carlos A. Co...
ICDCS
2011
IEEE
12 years 8 months ago
The Routing Continuum from Shortest-Path to All-Path: A Unifying Theory
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
Yanhua Li, Zhi-Li Zhang, Daniel Boley