John N. Tsitsiklis

Proceedings of the Computational Learning Theory and Kernel Machines, 2003

Network resource allocation and a congestion game: the single link case.

[BibT_eX]

[DOI]

Ramesh Johari

Proceedings of the 42nd IEEE Conference on Decision and Control, 2003

2002

On Average Versus Discounted Reward Temporal-Difference Learning.

[BibT_eX]

[DOI]

Mach. Learn., 2002

On the Convergence of Optimistic Policy Iteration.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2002

2001

Regression methods for pricing complex American-style options.

[BibT_eX]

[DOI]

IEEE Trans. Neural Networks, 2001

Deciding stability and mortality of piecewise affine dynamical systems.

[BibT_eX]

[DOI]

Olivier Bournez

Pascal Koiran

Theor. Comput. Sci., 2001

Simulation-based optimization of Markov reward processes.

[BibT_eX]

[DOI]

Peter Marbach

IEEE Trans. Autom. Control., 2001

The Stability of Saturated Linear Dynamical Systems Is Undecidable.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

Semiglobal nonlinear stabilization via approximate policy iteration.

[BibT_eX]

[DOI]

C. I. Boussios

Munther A. Dahleh

Proceedings of the American Control Conference, 2001

2000

Congestion-dependent pricing of network services.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2000

Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard.

[BibT_eX]

[DOI]

Stéphane Gaubert

IEEE Trans. Autom. Control., 2000

Gradient Convergence in Gradient methods with Errors.

[BibT_eX]

[DOI]

SIAM J. Optim., 2000

Call admission control and routing in integrated services networks using neuro-dynamic programming.

[BibT_eX]

[DOI]

Peter Marbach

Oliver Mihatsch

IEEE J. Sel. Areas Commun., 2000

A survey of computational complexity results in systems and control.

[BibT_eX]

[DOI]

Autom., 2000

Performance of multiclass Markovian queueing networks.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE Conference on Decision and Control, 2000

1999

Optimal stopping of Markov processes: Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional financial derivatives.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1999

Performance analysis of multiclass queueing networks.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 1999

Large deviations analysis of the generalized processor sharing policy.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 1999

The Complexity of Optimal Queuing Network Control.

[BibT_eX]

[DOI]

Math. Oper. Res., 1999

Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach.

[BibT_eX]

[DOI]

Mach. Learn., 1999

Average cost temporal-difference learning.

[BibT_eX]

[DOI]

Autom., 1999

Complexity of stability and controllability of elementary hybrid systems.

[BibT_eX]

[DOI]

Autom., 1999

Actor-Critic Algorithms.

[BibT_eX]

[DOI]

Vijay R. Konda

Proceedings of the Advances in Neural Information Processing Systems 12, [NIPS Conference, Denver, Colorado, USA, November 29, 1999

1998

Implementation of efficient algorithms for globally optimal trajectories.

[BibT_eX]

[DOI]

Lazaros C. Polymenakos

IEEE Trans. Autom. Control., 1998

Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1998

1997

An analysis of temporal-difference learning with function approximation.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1997

Correction to "Stability Conditions for Multiclass Fluid Queueing Networks".

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1997

Lyapunov exponents of pairs of matrices, a correction.

[BibT_eX]

[DOI]

Math. Control. Signals Syst., 1997

The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate.

[BibT_eX]

[DOI]

Math. Control. Signals Syst., 1997

When is a Pair of Matrices Mortal?

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Rollout Algorithms for Combinatorial Optimization.

[BibT_eX]

[DOI]

Cynara Wu

J. Heuristics, 1997

Reinforcement Learning for Call Admission Control and Routing in Integrated Service Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 10, 1997

A neuro-dynamic programming approach to admission control in ATM networks: the single link case.

[BibT_eX]

[DOI]

Peter Marbach

Proceedings of the 1997 IEEE International Conference on Acoustics, 1997

Introduction to linear optimization.

[BibT_eX]

Athena scientific optimization and computation series 6, Athena Scientific, ISBN: 978-1-886529-19-9, 1997

1996

Stability conditions for multiclass fluid queueing networks.

[BibT_eX]

[DOI]

George H. Polychronopoulos

IEEE Trans. Autom. Control., 1996

Stochastic shortest path problems with recourse.

[BibT_eX]

[DOI]

Networks, 1996

Feature-Based Methods for Large Scale Dynamic Programming.

[BibT_eX]

[DOI]

Mach. Learn., 1996

Approximate Solutions to Optimal Stopping Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 9, 1996

Analysis of Temporal-Diffference Learning with Function Approximation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 9, 1996

Neuro-dynamic programming.

[BibT_eX]

[DOI]

Optimization and neural computation series 3, Athena Scientific, ISBN: 1886529108, 1996

1995

Efficient algorithms for globally optimal trajectories.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1995

Branching bandits and Klimov's problem: achievable region and side constraints.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 1995

Statistical Multiplexing of Multiple Time-Scale Markov Streams.

[BibT_eX]

[DOI]

David N. C. Tse

Robert G. Gallager

IEEE J. Sel. Areas Commun., 1995

On the Average Communication Complexity of Asynchronous Distributed Algorithms.

[BibT_eX]

[DOI]

J. ACM, 1995

Worst-case identification of nonlinear fading memory systems.

[BibT_eX]

[DOI]

Autom., 1995

Stable LInear Approximations to Dynamic Programming for Stochastic Control Problems with Local Transitions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 8, 1995

1994

Data fusion with minimal communication.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

The efficiency of greedy routing in hypercubes and butterflies.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1994

Some properties of optimal thresholds in decentralized detection.

[BibT_eX]

[DOI]

William W. Irving

IEEE Trans. Autom. Control., 1994

Local Versus Nonlocal Computation of Length of Digitized Curves.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 1994

Asynchronous Stochastic Approximation and Q-Learning.

[BibT_eX]

[DOI]

Mach. Learn., 1994

The Complexity of Optimal Queueing Network Control.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993

Efficient Routing Schemes for Multiple Broadcasts in Hypercubes.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1993

Extremal properties of likelihood-ratio quantizers.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1993

Optimal asymptotic identification under bounded disturbances.

[BibT_eX]

[DOI]

David N. C. Tse

Munther A. Dahleh

IEEE Trans. Autom. Control., 1993

PAC Learning with Generalized Samples and an Applicaiton to Stochastic Geometry.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 1993

Active Learning Using Arbitrary Binary Valued Queries.

[BibT_eX]

[DOI]

Sanjeev R. Kulkarni

Sanjoy K. Mitter

Mach. Learn., 1993

On the Communication Complexity of Distributed Algebraic Computation.

[BibT_eX]

[DOI]

J. ACM, 1993

An Efficient Algorithm for Multiple Simultaneous Broadcasts in the Hypercube.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs.

[BibT_eX]

[DOI]

Harilaos N. Psaraftis

Oper. Res., 1993

Local Versus Non-local Computation of Length of Digitized Curves.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1992

Special cases of traveling salesman and repairman problems with time windows.

[BibT_eX]

[DOI]

Networks, 1992

PAC Learning With Generalized Samples and an Application to Stochastic Geometry.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

On a lower bound for the redundancy of reliable networks with noisy gates.

[BibT_eX]

[DOI]

Nicholas Pippenger

IEEE Trans. Inf. Theory, 1991

On the Communication Complexity of Solving a Polynomial Equation.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

An Analysis of Stochastic Shortest Path Problems.

[BibT_eX]

[DOI]

Math. Oper. Res., 1991

Optimal Communication Algorithms for Hypercubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1991

On the Predictability of Coupled Automata: An Allegory about Chaos.

[BibT_eX]

[DOI]

Samuel R. Buss

Complex Syst., 1991

Some aspects of parallel and distributed iterative algorithms - A survey<sup>, </sup>.

[BibT_eX]

[DOI]

Autom., 1991

1990

Communication Complexity of Algebraic Computation (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Markov Chains with Rare Transitions and Simulated Annealing.

[BibT_eX]

[DOI]

Math. Oper. Res., 1989

On the control of discrete-event dynamical systems.

[BibT_eX]

[DOI]

Math. Control. Signals Syst., 1989

The complexity of dynamic programming.

[BibT_eX]

[DOI]

Chef-Seng Chow

J. Complex., 1989

On the Use of Random Numbers in Asynchronous Simulation via Rollback.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Convergence rate and termination of asynchronous iterative algorithms.

[BibT_eX]

[DOI]

Proceedings of the 3rd international conference on Supercomputing, 1989

Parallel and distributed computation.

[BibT_eX]

Prentice Hall, ISBN: 978-0-13-648759-3, 1989

1988

Decentralized detection by a large number of sensors.

[BibT_eX]

[DOI]

Math. Control. Signals Syst., 1988

1987

On Stochastic Scheduling with In-Tree Precedence Constraints.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

On the Stability of Asynchronous Iterative Processes.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1987

The Complexity of Markov Decision Processes.

[BibT_eX]

[DOI]

Math. Oper. Res., 1987

Communication complexity of convex optimization.

[BibT_eX]

[DOI]

J. Complex., 1987

1986

The performance of a precedence-based queuing discipline.

[BibT_eX]

[DOI]

Pierre A. Humblet

J. ACM, 1986

1985

A fast algorithm for linear estimation of two- dimensional isotropic random fields.

[BibT_eX]

[DOI]

Bernard C. Levy

IEEE Trans. Inf. Theory, 1985

1984

Problems in decentralized decision making and computation.

[BibT_eX]

[DOI]

PhD thesis, 1984

1982

On the Complexity of Designing Distributed Protocols

[BibT_eX]

[DOI]