4037 search results - page 220 / 808 » Routing without ordering |
ICAD
2004
14 years 4 days ago
2004
An orientation experiment was carried out in a spatially immersive virtual environment. The task of subjects was to navigate with 6 degrees of freedom flying method through a pred...
IC
2000
14 years 3 days ago
2000
Nowadays, we face the continually growing importance of information: it is quickly becoming our most valuable resource. The Smart Data Server improves the quality of information by...
WINE
2010
Springer
13 years 8 months ago
2010
Springer
Braess's paradox, in its original context, is the counter-intuitive observation that, without lessening demand, closing roads can improve traffic flow. With the explosion of d...
IPL
2007
13 years 10 months ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
FC
2005
Springer
14 years 4 months ago
2005
Springer
At Financial Cryptography 2003, Jakobsson, Hubaux, and Butty´an suggested a lightweight micro-payment scheme aimed at encouraging routing collaboration in asymmetric multi-hop cel...