Theses most similar to Sampling-based algorithms for optimal path planning problems (Karaman, Sertac; 2012) read it

Routing problems in stochastic time-dependent networks with applications in dynamic traffic assignment

Gao, Song, 1976- (2002)

  • Advisor: Ismail Chabini
  • Department of Civil and Environmental Engineering
Read it

Randomness versus non-determinism in distributed computing

Saias, Alain Isaac (1995)

  • Advisor:
  • Department of Mathematics
Read it

Faster generation of random spanning trees

Ma̧dry, Aleksander (2009)

  • Advisor: Jonathan A. Kelner
  • Department of Electrical Engineering and Computer Science
Read it

Computability, inference and modeling in probabilistic programming

Roy, Daniel Murphy (2011)

  • Advisor: Leslie P. Kaelbling
  • Department of Electrical Engineering and Computer Science
Read it

A general index heuristic for search with mobile agents

Temple, Thomas J. (Thomas John) (2011)

  • Advisors: Anouck Girard; Schmidt, Brian W. (Brian William)
  • Department of Aeronautics and Astronautics
Read it

On threshold models over finite networks

Adam, Elie M (2012)

  • Advisors: Munther A. Dahleh; Ozdaglar, Asuman E
  • Department of Electrical Engineering and Computer Science
Read it

Distributed computation in wireless and dynamic networks

Oshman, Rotei (2012)

  • Advisor: Nancy A. Lynch
  • Department of Electrical Engineering and Computer Science
Read it

Local distributed algorithms for multi-robot systems

Cornejo Collado, Alejandro (2013)

  • Advisor: Nancy Lynch
  • Department of Electrical Engineering and Computer Science
Read it

Topics in distributed computing : the impact of partial synchrony, and modular decomposition of algorithms

Welch, Jennifer (1988)

  • Advisor: Nancy A. Lynch
  • Department of Electrical Engineering and Computer Science
Read it

Algorithms for autonomous urban navigation with formal specifications

Chaudhari, Pratik (Pratik Anil) (2014)

  • Advisor: Emilio Frazzoli
  • Department of Aeronautics and Astronautics
Read it