Takayuki Osogami

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Improved Integer Programming Approaches for Chance-Constrained Stochastic Programming.

[BibT_eX]

[DOI]

Hiroki Yanagisawa

Proceedings of the IJCAI 2013, 2013

Map Matching with Inverse Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

2012

Large-Scale Nonparametric Estimation of Vehicle Travel Time Distributions.

[BibT_eX]

[DOI]

Rikiya Takahashi

Tetsuro Morimura

Proceedings of the Twelfth SIAM International Conference on Data Mining, 2012

Robustness and risk-sensitivity in Markov decision processes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Map matching with Hidden Markov Model on sampled road network.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Pattern Recognition, 2012

Time-Consistency of Optimization Problems.

[BibT_eX]

[DOI]

Tetsuro Morimura

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

On Markov-Krein characterization of the mean waiting time in M/G/K and other queueing systems.

[BibT_eX]

[DOI]

Varun Gupta

Queueing Syst. Theory Appl., 2011

Real-time data assimilation.

[BibT_eX]

[DOI]

Shoko Suzuki

Proceedings of the Winter Simulation Conference 2011, 2011

Iterated risk measures for risk-sensitive Markov decision processes with discounted cost.

[BibT_eX]

[DOI]

Proceedings of the UAI 2011, 2011

Tight moments-based bounds for queueing systems.

[BibT_eX]

[DOI]

Varun Gupta

Proceedings of the SIGMETRICS 2011, 2011

Simple bounds for a transient queue.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE/IFIP International Conference on Dependable Systems and Networks, 2011

2010

Differentiating the performance of systems more reliably.

[BibT_eX]

[DOI]

Perform. Evaluation, 2010

Analysis of Page Replacement Policies in the Fluid Limit.

[BibT_eX]

[DOI]

Ryo Hirade

Oper. Res., 2010

Semidefinite optimization for transient analysis of queues.

[BibT_eX]

[DOI]

Proceedings of the SIGMETRICS 2010, 2010

2009

Finding probably best systems quickly via simulations.

[BibT_eX]

[DOI]

ACM Trans. Model. Comput. Simul., 2009

A Fluid Limit for Cache Algorithms with General Request Processes.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

Evaluating availability under quasi-heavy-tailed repair times.

[BibT_eX]

[DOI]

Sei Kato

Proceedings of the 38th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2008

2007

Accuracy of measured throughputs and mean response times.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2007

Optimizing system configurations quickly by guessing at the performance.

[BibT_eX]

[DOI]

Sei Kato

Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2007

Relations in the Central Limit Theorem Version of the Response Time Law.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on the Quantitative Evaluaiton of Systems (QEST 2007), 2007

2006

Finding probably best system configurations quickly.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2006

How many servers are best in a dual-priority M/PH/k system?

[BibT_eX]

[DOI]

Perform. Evaluation, 2006

Closed form solutions for mapping general distributions to quasi-minimal PH distributions.

[BibT_eX]

[DOI]

Perform. Evaluation, 2006

Finding probably best systems quickly via simulation.

[BibT_eX]

[DOI]

Proceedings of the Winter Simulation Conference WSC 2006, 2006

Finding probably better system configurations quickly.

[BibT_eX]

[DOI]

Toshinari Itoko

Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, 2006

2005

Robustness of threshold policies in beneficiary-donor model.

[BibT_eX]

[DOI]

Alan Scheller-Wolf

SIGMETRICS Perform. Evaluation Rev., 2005

Multi-Server Queueing Systems with Multiple Priority Classes.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2005

Analysis of cycle stealing with switching times and thresholds.

[BibT_eX]

[DOI]

Alan Scheller-Wolf

Perform. Evaluation, 2005

Nearly insensitive bounds on SMART scheduling.

[BibT_eX]

[DOI]

Adam Wierman

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2005

2004

A recursive analysis technique for multi-dimensionally infinite Markov chains.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2004

2003

Modeling TCP-vegas under on/off traffic.

[BibT_eX]

[DOI]

Adam Wierman

Jörgen Olsén

SIGMETRICS Perform. Evaluation Rev., 2003

Local Search Algorithms for the Bin Packing Problem and Their Relationships to Various Construction Heuristics.

[BibT_eX]

[DOI]

Hiroyuki Okano

J. Heuristics, 2003

Cycle stealing under immediate dispatch task assignment.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Analysis of cycle stealing with switching cost.

[BibT_eX]

[DOI]

Alan Scheller-Wolf

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2003

A Unified Framework for Modeling TCP-Vegas, TCP-SACK, and TCP-Reno.

[BibT_eX]

[DOI]

Adam Wierman

Jörgen Olsén

Proceedings of the 11th International Workshop on Modeling, 2003

Analysis of Task Assignment with Cycle Stealing under Central Queue.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

A Closed-Form Solution for Mapping General Distributions to Minimal PH Distributions.

[BibT_eX]

[DOI]

Proceedings of the Computer Performance Evaluations, 2003

Necessary and Sufficient Conditions for Representing General Distributions by Coxians.

[BibT_eX]

[DOI]

Proceedings of the Computer Performance Evaluations, 2003

2000

Classification of Various Neighborhood Operations for the Nurse Scheduling Problem.

[BibT_eX]

[DOI]