| 2009 |
|---|
| 31 | EE | Dimitri P. Bertsekas:
Auction Algorithms.
Encyclopedia of Optimization 2009: 128-132 |
| 30 | EE | Dimitri P. Bertsekas:
Neuro-Dynamic Programming.
Encyclopedia of Optimization 2009: 2555-2560 |
| 2008 |
|---|
| 29 | EE | Huizhen Yu,
Dimitri P. Bertsekas:
New Error Bounds for Approximations from Projected Linear Equations.
EWRL 2008: 253-267 |
| 2007 |
|---|
| 28 | EE | Dimitri P. Bertsekas,
Paul Tseng:
Set Intersection Theorems and Existence of Optimal Solutions.
Math. Program. 110(2): 287-314 (2007) |
| 2006 |
|---|
| 27 | EE | Dimitri P. Bertsekas:
Neuro-Dynamic Programming: An Overview and Recent Results.
OR 2006: 71-72 |
| 2004 |
|---|
| 26 | EE | Huizhen Yu,
Dimitri P. Bertsekas:
Discretized Approximations for POMDP with Average Cost.
UAI 2004: 519 |
| 2003 |
|---|
| 25 | EE | A. Nedic,
Dimitri P. Bertsekas:
Least Squares Policy Evaluation Algorithms with Linear Function Approximation.
Discrete Event Dynamic Systems 13(1-2): 79-110 (2003) |
| 24 | EE | Asuman E. Ozdaglar,
Dimitri P. Bertsekas:
Routing and wavelength assignment in optical networks.
IEEE/ACM Trans. Netw. 11(2): 259-272 (2003) |
| 2001 |
|---|
| 23 | EE | Chi-Hsiang Yeh,
Emmanouel A. Varvarigos,
Dimitri P. Bertsekas,
Hussein T. Mouftah:
Reservation-Based Session Routing for Broadband Communication Networks with Strict QoS Requirements.
ICOIN 2001: 593- |
| 2000 |
|---|
| 22 | | Dimitri P. Bertsekas,
M. L. Homer,
D. A. Logan,
Stephen D. Patek,
N. R. Sandell:
Missile defense and interceptor allocation by neuro-dynamic programming.
IEEE Transactions on Systems, Man, and Cybernetics, Part A 30(1): 42-51 (2000) |
| 1999 |
|---|
| 21 | | Dimitri P. Bertsekas,
David A. Castañon:
Rollout Algorithms for Stochastic Scheduling Problems.
J. Heuristics 5(1): 89-108 (1999) |
| 1997 |
|---|
| 20 | | Dimitri P. Bertsekas,
John N. Tsitsiklis,
Cynara Wu:
Rollout Algorithms for Combinatorial Optimization.
J. Heuristics 3(3): 245-262 (1997) |
| 1996 |
|---|
| 19 | | Paul Tseng,
Dimitri P. Bertsekas:
A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems.
IPCO 1996: 85-93 |
| 18 | EE | Satinder P. Singh,
Dimitri P. Bertsekas:
Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems.
NIPS 1996: 974-980 |
| 17 | | Emmanouel A. Varvarigos,
Dimitri P. Bertsekas:
A Conflict Sense Routing Protocol and Its Performance for Hypercubes.
IEEE Trans. Computers 45(6): 693-703 (1996) |
| 16 | | S. A. Savari,
Dimitri P. Bertsekas:
Finite Termination of Asynchronous Iterative Algorithms.
Parallel Computing 22(1): 39-56 (1996) |
| 1995 |
|---|
| 15 | EE | Emmanouel A. Varvarigos,
Dimitri P. Bertsekas:
Dynamic Broadcasting in Parallel Computing.
IEEE Trans. Parallel Distrib. Syst. 6(2): 120-131 (1995) |
| 14 | | Emmanouel A. Varvarigos,
Dimitri P. Bertsekas:
Transposition of Banded Matrices in Hypercubes: A Nearly Isotropic Task.
Parallel Computing 21(2): 243-264 (1995) |
| 1994 |
|---|
| 13 | EE | Emmanouel A. Varvarigos,
Dimitri P. Bertsekas:
Performance of hypercube routing schemes with or without buffering.
IEEE/ACM Trans. Netw. 2(3): 299-311 (1994) |
| 12 | | Emmanouel A. Varvarigos,
Dimitri P. Bertsekas:
Partial Multinode Broadcast and Partial Exchange Algorithms for d-Dimensional Meshes.
J. Parallel Distrib. Comput. 23(2): 177-189 (1994) |
| 11 | | Lazaros Polymenakos,
Dimitri P. Bertsekas:
Parallel Shortest Path Auction Algorithms.
Parallel Computing 20(9): 1221-1247 (1994) |
| 1993 |
|---|
| 10 | EE | Emmanouel A. Varvarigos,
Dimitri P. Bertsekas:
Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets.
IEEE Trans. Parallel Distrib. Syst. 4(2): 144-154 (1993) |
| 9 | | Paul Tseng,
Dimitri P. Bertsekas:
On the convergence of the exponential multiplier method for convex programming.
Math. Program. 60: 1-19 (1993) |
| 1992 |
|---|
| 8 | | Emmanouel A. Varvarigos,
Dimitri P. Bertsekas:
Partial Multinode Broadcast Algorithms for D-Dimensional Meshes.
ICPP (3) 1992: 51-54 |
| 7 | | Jonathan Eckstein,
Dimitri P. Bertsekas:
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators.
Math. Program. 55: 293-318 (1992) |
| 6 | | Emmanouel A. Varvarigos,
Dimitri P. Bertsekas:
Communication algorithms for isotropic tasks in hypercubes and wraparound meshes.
Parallel Computing 18(11): 1233-1257 (1992) |
| 1991 |
|---|
| 5 | | Dimitri P. Bertsekas,
C. Özveren,
George D. Stamoulis,
Paul Tseng,
John N. Tsitsiklis:
Optimal Communication Algorithms for Hypercubes.
J. Parallel Distrib. Comput. 11(4): 263-275 (1991) |
| 4 | | Dimitri P. Bertsekas,
David A. Castañon:
Parallel synchronous and asynchronous implementations of the auction algorithm.
Parallel Computing 17(6-7): 707-732 (1991) |
| 1990 |
|---|
| 3 | | Paul Tseng,
Dimitri P. Bertsekas:
Relaxation Methods for Monotropic Programs.
Math. Program. 46: 127-151 (1990) |
| 1989 |
|---|
| 2 | EE | Dimitri P. Bertsekas,
John N. Tsitsiklis:
Convergence rate and termination of asynchronous iterative algorithms.
ICS 1989: 461-470 |
| 1987 |
|---|
| 1 | | Eli Gafni,
Dimitri P. Bertsekas:
Asymptotic optimality of shortest path routing algorithms.
IEEE Transactions on Information Theory 33(1): 83-90 (1987) |
