Sciweavers

707 search results - page 97 / 142
» Solving path problems on the GPU
Sort
View
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 3 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
CE
2007
99views more  CE 2007»
14 years 11 months ago
Self-organising navigational support in lifelong learning: How predecessors can lead the way
Increased flexibility and modularisation in higher education complicates the process of learners finding their way through the offerings of higher education institutions. In lifel...
José Janssen, Colin Tattersall, Wim Waterin...
JUCS
2008
138views more  JUCS 2008»
14 years 11 months ago
A Knowledge Discovery Agent for a Topology Bit-map in Ad Hoc Mobile Networks
: A central characteristic of ad hoc mobile networks is the frequent changes of their topology. This is the source of many problems that need to be solved. AODV is an on-demand rou...
SungSoo Lee, HangKon Kim, ChongGun Kim
JGT
2010
90views more  JGT 2010»
14 years 10 months ago
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
Michael Krivelevich, Raphael Yuster
ICASSP
2011
IEEE
14 years 3 months ago
A near-optimal least squares solution to received signal strength difference based geolocation
A simple geometric interpretation for received signal strength (RSS) difference based geolocation can be illustrated by considering a plane containing a single pair of receivers a...
Sichun Wang, Robert J. Inkol