Theses most similar to those of author Mostagir, Mohamed

Fully polynomial time approximation schemes for sequential decision problems (2005) read it

Small-depth counting networks and related topics

Klugerman, Michael Richard (1994)

  • Advisor: Frank Thomason Leighton
  • Department of Mathematics
Read it

Fault-tolerant sorting networks

Ma, Yuan (1994)

  • Advisor: Tom Leighton
  • Department of Mathematics
Read it

Scheduling task systems with resources.

Lloyd, Errol Lynn (1980)

  • Advisor: Ronald L. Rivest
  • Department of Electrical Engineering and Computer Science
Read it

Approximation algorithms for stochastic scheduling problems

Dean, Brian C. (Brian Christopher), 1975- (2005)

  • Advisor: Michel Goemans
  • Department of Electrical Engineering and Computer Science
Read it

Robust, risk-sensitive, and data-driven control of Markov Decision Processes

Le Tallec, Yann (2007)

  • Advisors: D. Simeste; J.N. Tsitsiklis
  • Operations Research Center
Read it

Approximation algorithms for stochastic scheduling on unrelated machines

Scott, Jacob (Jacob Healy) (2008)

  • Advisor: David R. Karger
  • Department of Electrical Engineering and Computer Science
Read it

Evaluation of boolean formulas with restricted inputs

Zhan, Bohua (2010)

  • Advisor: Edward Farhi
  • Department of Physics
Read it

Algorithms and approximation schemes for machine scheduling problems

Sengupta, Sudipta, 1974- (1999)

  • Advisor: James B. Orlin
  • Department of Electrical Engineering and Computer Science
Read it

Bounds on multithreaded computations by work stealing

Suksompong, Warut (2014)

  • Advisor: Charles E. Leiserson
  • Department of Electrical Engineering and Computer Science
Read it

Optimization problems with incomplete information

Hwang, Daw-sen (2016)

  • Advisor: Jaillet, Patrick
  • Department of Electrical Engineering and Computer Science
Read it