Bernstein David

David Bernstein

Information about the author David Bernstein will soon be added to the site.
Found 16 papers in total
A flexible Java representation for uncertainty in online operations-research models
A flexible Java representation for uncertainty in online operations-research models
2001
Online OR models have been the subject of increased attention in recent years with the...
The holding problem with real-time information available
The holding problem with real-time information available
2001
Holding is one of the most commonly used real-time control strategies in transit...
A flexible Java representation for uncertainty in online operations-research models
A flexible Java representation for uncertainty in online operations-research models
2001
Online OR models have been the subject of increased attention in recent years with the...
The holding problem with real-time information available
The holding problem with real-time information available
2001
Holding is one of the most commonly used real-time control strategies in transit...
Some map matching algorithms for personal navigation assistants
Some map matching algorithms for personal navigation assistants
2000
Third-generation personal navigation assistants (i.e., those that provide a map, the...
Mathematical analysis of statistical sampling for estimating computer cache performance
Mathematical analysis of statistical sampling for estimating computer cache performance
1996
Computer cache memory simulations consume a lot of resources, both in terms of disk...
Mathematical analysis of statistical sampling for estimating computer cache performance
Mathematical analysis of statistical sampling for estimating computer cache performance
1996
Computer cache memory simulations consume a lot of resources, both in terms of disk...
Dynamic systems, variational inequalities and control theoretic models for predicting time-varying urban network flows
Dynamic systems, variational inequalities and control theoretic models for predicting time-varying urban network flows
1996
In this paper, the authors set forth certain axioms for a positive theory of dynamic...
Dynamic systems, variational inequalities and control theoretic models for predicting time-varying urban network flows
Dynamic systems, variational inequalities and control theoretic models for predicting time-varying urban network flows
1996
In this paper, the authors set forth certain axioms for a positive theory of dynamic...
A comparison of system optimum and user equilibrium dynamic traffic assignments with schedule delays
A comparison of system optimum and user equilibrium dynamic traffic assignments with schedule delays
1995
One way to estimate the potential benefits of new traffic control and management...
Dynamic systems, variational inequalities and control theoretic models for predicting time-varying urban network flows
Dynamic systems, variational inequalities and control theoretic models for predicting time-varying urban network flows
1996
In this paper, the authors set forth certain axioms for a positive theory of dynamic...
Day-to-day dynamic network disequilibria and idealized traveler information systems
Day-to-day dynamic network disequilibria and idealized traveler information systems
1994
In this paper the authors present tatonnement models for calculating static Wardropian...
Intermodal pricing using network flow techniques
Intermodal pricing using network flow techniques
1995
Traditional cost calculations do not accurately estimate the opportunity costs of...
A note on ‘Departure time and route choice for the morning commute’
A note on ‘Departure time and route choice for the morning commute’
1994
This note corrects a small but important error in the uniform portion of the socially...
A variational inequality formulation of the dynamic network user equilibrium problem
A variational inequality formulation of the dynamic network user equilibrium problem
1993
In the present paper the authors are concerned with developing more realistic dynamic...
Approximation algorithms for scheduling arithmetic expression on pipelined machines
Approximation algorithms for scheduling arithmetic expression on pipelined machines
1989
Consider a processor which can issue one instruction every machine cycle, but can use...
Papers per page: