1. DSpace at MEDIU

Browsing by Author Bertsekas, Dimitri P.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 20 of 98  next >
Issue DateTitleAuthor(s)
5-Jun-2013A conflict sense routing protocol and its performance for hypercubesVarvarigos, Emmanouel A.; Bertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A forward/reverse auction algorithm for asymmetric assignment problemsBertsekas, Dimitri P.; Castañon, David A.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A generic auction algorithm for the minimum cost network flow problemBertsekas, Dimitri P.; Castañon, David A.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A hybrid incremental gradient method for least squares problemsBertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A new class of incremental gradient methods for least squares problemsBertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A note on error bounds for convex and nonconvex programsBertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A note on error bounds for convex and nonconvex programsBertsekas, Dimitri P.
5-Jun-2013A note on error bounds for convex and nonconvex programsBertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A note on the robust computation of rollout policiesBertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A simple and fast label correcting algorithm for shortest pathsBertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A survey of some aspects of parallel and distributed iterative algorithmsBertsekas, Dimitri P.; Tsitsiklis, John N.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A unified framework for primal-dual methods in minimum cost network flow problemsBertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A value iteration method for the average cost dynamic programming problemBertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013Adaptive aggregation methods for discounted dynamic programmingBertsekas, Dimitri P.; Castañon, David A.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013Adaptive aggregation methods for infinite horizon dynamic programmingBertsekas, Dimitri P.; Castañon, David A.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013Adaptive aggregation methods for infinite horizon dynamic programmingBertsekas, Dimitri P.; Castañon, David A.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013An alternating direction method for linear programmingEckstein, Jonathan.; Bertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013An analysis of stochastic shortest path problemsBertsekas, Dimitri P.; Tsitsiklis, John N.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013An auction algorithm for shortest pathsBertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013An auction algorithm for the max-flow problemBertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
Showing results 1 to 20 of 98  next >