Sciweavers

1336 search results - page 42 / 268
» SMTP Path Analysis
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
Routing Primitives for Wireless Mesh Networks: Design, Analysis and Experiments
—In this paper, we consider routing in multi-hop wireless mesh networks. We analyze three standardized and commonly deployed routing mechanisms that we term “nodepair discovery...
Stanislav Miskovic, Edward W. Knightly
INFOCOM
2005
IEEE
14 years 2 months ago
Topology aware overlay networks
— Recently, overlay networks have emerged as a means to enhance end-to-end application performance and availability. Overlay networks attempt to leverage the inherent redundancy ...
Junghee Han, David Watson, Farnam Jahanian
ICRA
2002
IEEE
111views Robotics» more  ICRA 2002»
14 years 1 months ago
Mission Planning for the Sun-Synchronous Navigation Field Experiment
This paper describes TEMPEST, a planner that enables a solar-powered rover to reason about path selection and event placement in terms of available solar energy and anticipated po...
Paul Tompkins, Anthony Stentz, William Whittaker
GECCO
2008
Springer
110views Optimization» more  GECCO 2008»
13 years 10 months ago
Crossover can provably be useful in evolutionary computation
We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoret...
Benjamin Doerr, Edda Happ, Christian Klein
ICTAI
2005
IEEE
14 years 2 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet