Sciweavers

2082 search results - page 154 / 417
» Change Paths in Reasoning!
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 3 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal
NETWORK
2006
96views more  NETWORK 2006»
15 years 3 months ago
Optimizing TCP and RLC interaction in the UMTS radio access network
TCP, the dominant transport protocol for Internet applications, suffers severe performance degradation due to packet losses when a wireless link is present in the endto-end path. ...
Juan J. Alcaraz, Fernando Cerdán, Joan Garc...
ICRA
2010
IEEE
122views Robotics» more  ICRA 2010»
15 years 2 months ago
Probabilistic collision state checker for crowded environments
Abstract— For path planning algorithms of robots it is important that the robot does not reach a state of inevitable collision. In crowded environments with many humans or robots...
Daniel Althoff, Matthias Althoff, Dirk Wollherr, M...
JPDC
2010
133views more  JPDC 2010»
14 years 10 months ago
Lock-free parallel dynamic programming
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
Alex Stivala, Peter J. Stuckey, Maria Garcia de la...
DM
2011
202views Education» more  DM 2011»
14 years 7 months ago
Two-ended regular median graphs
We show that regular median graphs of linear growth are the Cartesian product of finite hypercubes with the two-way infinite path. Such graphs are Cayley graphs and have only tw...
Wilfried Imrich, Sandi Klavzar