425 search results - page 80 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
125
Voted
ICC
2009
IEEE
15 years 9 months ago
2009
IEEE
— In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their s...
151
Voted
ICPADS
2010
IEEE
15 years 4 days ago
2010
IEEE
To fully tap into the potential of heterogeneous machines composed of multicore processors and multiple accelerators, simple offloading approaches in which the main trunk of the ap...
102
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
We consider an ad-hoc wireless network operating within a free market economic model. Users send data over a choice of paths, and scheduling and routing decisions are updated dyna...
WS
2004
ACM
15 years 7 months ago
2004
ACM
Title of Thesis: DISTRIBUTED TRUST EVALUATION IN AD-HOC NETWORKS Georgios E. Theodorakopoulos, Master of Science, 2004 Thesis directed by: Professor John S. Baras Department of El...
121
Voted
PACT
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...