default search action
Takayuki Osogami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i19]Hirota Kinoshita, Takayuki Osogami, Kohei Miyaguchi:
Socially efficient mechanism on the minimum budget. CoRR abs/2407.18515 (2024) - 2023
- [c51]Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami, Marco Scarsini, Segev Wasserkrug:
Learning the Stackelberg Equilibrium in a Newsvendor Game. AAMAS 2023: 242-250 - [c50]Hiroshi Kajino, Kohei Miyaguchi, Takayuki Osogami:
Biases in Evaluation of Molecular Optimization Methods and Bias Reduction Strategies. ICML 2023: 15567-15585 - [c49]Takayuki Katsuki, Takayuki Osogami:
Regression with Sensor Data Containing Incomplete Observations. ICML 2023: 15911-15927 - [c48]Takayuki Osogami, Segev Wasserkrug, Elisheva S. Shamash:
Learning Efficient Truthful Mechanisms for Trading Networks. IJCAI 2023: 2862-2869 - [c47]Alexander Zadorojniy, Takayuki Osogami, Orit Davidovich:
A Rigorous Risk-aware Linear Approach to Extended Markov Ratio Decision Processes with Embedded Learning. IJCAI 2023: 5475-5483 - [i18]Takayuki Katsuki, Takayuki Osogami:
Regression with Sensor Data Containing Incomplete Observations. CoRR abs/2304.13415 (2023) - [i17]Segev Wasserkrug, Takayuki Osogami:
Who Benefits from a Multi-Cloud Market? A Trading Networks Based Analysis. CoRR abs/2310.12666 (2023) - 2022
- [i16]Hiroshi Kajino, Kohei Miyaguchi, Takayuki Osogami:
Biases in In Silico Evaluation of Molecular Optimization Methods and Bias-Reduced Evaluation Methodology. CoRR abs/2201.12163 (2022) - [i15]Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami, Marco Scarsini, Segev Wasserkrug:
Online Learning in Supply-Chain Games. CoRR abs/2207.04054 (2022) - [i14]Takayuki Osogami, Segev Wasserkrug, Elisheva S. Shamash:
Mechanism Learning for Trading Networks. CoRR abs/2208.09222 (2022) - 2021
- [j19]Mor Harchol-Balter
, Takayuki Osogami
Correction to: Multi-server queueing systems with multiple priority classes. Queueing Syst. Theory Appl. 99(3-4): 397-398 (2021) - [c46]Takayuki Osogami:
Second Order Techniques for Learning Time-series with Structural Breaks. AAAI 2021: 9259-9267 - 2020
- [c45]Takayuki Osogami:
Uncorrected Least-Squares Temporal Difference with Lambda-Return. AAAI 2020: 5323-5330 - [i13]Takayuki Osogami:
Proofs and additional experiments on Second order techniques for learning time-series with structural breaks. CoRR abs/2012.08037 (2020)
2010 – 2019
- 2019
- [c44]Takayuki Osogami, Rudy Raymond:
Determinantal Reinforcement Learning. AAAI 2019: 4659-4666 - [c43]Takayuki Osogami, Toshihiro Takahashi:
Real-time tree search with pessimistic scenarios: Winning the NeurIPS 2018 Pommerman Competition. ACML 2019: 583-598 - [i12]Takayuki Osogami, Toshihiro Takahashi:
Real-time tree search with pessimistic scenarios. CoRR abs/1902.10870 (2019) - [i11]Kun Zhao, Takayuki Osogami, Tetsuro Morimura:
Visual analytics for team-based invasion sports with significant events and Markov reward process. CoRR abs/1907.01221 (2019) - [i10]Takayuki Osogami:
Supplementary material for Uncorrected least-squares temporal difference with lambda-return. CoRR abs/1911.06057 (2019) - 2018
- [c42]Takayuki Osogami, Rudy Raymond, Akshay Goel
Dynamic Determinantal Point Processes. AAAI 2018: 3868-3875 - [c41]Takayuki Katsuki, Takayuki Osogami, Akira Koseki, Masaki Ono, Michiharu Kudo, Masaki Makino, Atsushi Suzuki:
Time-Discounting Convolution for Event Sequences with Ambiguous Timestamps. ICDM 2018: 1085-1090 - [i9]Takayuki Katsuki, Takayuki Osogami, Akira Koseki, Masaki Ono, Michiharu Kudo, Masaki Makino, Atsushi Suzuki:
Time-Discounting Convolution for Event Sequences with Ambiguous Timestamps. CoRR abs/1812.02395 (2018) - 2017
- [j18]Takayuki Osogami, Sakyasingha Dasgupta:
Learning the values of the hyperparameters of a dynamic Boltzmann machine. IBM J. Res. Dev. 61(4-5): 8:1-8:8 (2017) - [c40]Sakyasingha Dasgupta, Takayuki Osogami:
Nonlinear Dynamic Boltzmann Machines for Time-Series Prediction. AAAI 2017: 1833-1839 - [c39]Takayuki Osogami, Hiroshi Kajino, Taro Sekiyama:
Bidirectional Learning for Time-series Models with Hidden Units. ICML 2017: 2711-2720 - [c38]Kun Zhao, Takayuki Osogami:
Modeling fluid simulation with dynamic Boltzmann machine. WSC 2017: 4503-4505 - [i8]Muhammad Anis Uddin Nasir, Hiroshi Horii, Marco Serafini, Nicolas Kourtellis, Rudy Raymond, Sarunas Girdzijauskas, Takayuki Osogami:
Load Balancing for Skewed Streams on Heterogeneous Cluster. CoRR abs/1705.09073 (2017) - [i7]Takayuki Osogami:
Boltzmann machines for time-series. CoRR abs/1708.06004 (2017) - [i6]Takayuki Osogami:
Boltzmann machines and energy-based models. CoRR abs/1708.06008 (2017) - [i5]Rudy Raymond, Takayuki Osogami, Sakyasingha Dasgupta:
Dynamic Boltzmann Machines for Second Order Moments and Generalized Gaussian Distributions. CoRR abs/1712.06132 (2017) - 2016
- [c37]Makoto Otsuka, Takayuki Osogami:
A Deep Choice Model. AAAI 2016: 850-856 - [c36]Sakyasingha Dasgupta, Takayuki Yoshizumi, Takayuki Osogami:
Regularized dynamic Boltzmann machine with Delay Pruning for unsupervised learning of temporal sequences. ICPR 2016: 1201-1206 - [c35]Takashi Imamichi, Takayuki Osogami, Rudy Raymond:
Truncating Shortest Path Search for Efficient Map-Matching. IJCAI 2016: 589-595 - [c34]Shohei Ohsawa, Yachiko Obara, Takayuki Osogami:
Gated Probabilistic Matrix Factorization: Learning Users' Attention from Missing Values. IJCAI 2016: 1888-1894 - [i4]Sakyasingha Dasgupta, Takayuki Yoshizumi, Takayuki Osogami:
Regularized Dynamic Boltzmann Machine with Delay Pruning for Unsupervised Learning of Temporal Sequences. CoRR abs/1610.01989 (2016) - [i3]Takayuki Osogami:
Learning binary or real-valued time-series via spike-timing dependent plasticity. CoRR abs/1612.04897 (2016) - 2015
- [j17]Takayuki Osogami, Rudy Raymond
Erratum to: Analysis of transient queues with semidefinite optimization. Queueing Syst. Theory Appl. 80(4): 387-388 (2015) - [c33]Takayuki Osogami:
Robust partially observable Markov decision process. ICML 2015: 106-115 - [i2]Takayuki Osogami, Makoto Otsuka:
Learning dynamic Boltzmann machines with spike-timing dependent plasticity. CoRR abs/1509.08634 (2015) - 2014
- [c32]Tetsuro Morimura, Takayuki Osogami, Tomoyuki Shirai:
Mixing-Time Regularized Policy Gradient. AAAI 2014: 1997-2003 - [c31]Rudy Raymond
An Approximate Counting for Big Textual Data Streams. ECAI 2014: 1085-1086 - [c30]Takayuki Osogami, Rudy Raymond
Efficient Policy Iteration for Periodic Markov Decision Processes. ECAI 2014: 1167-1172 - [c29]Takayuki Osogami, Takayuki Katsuki:
A Hierarchical Bayesian Choice Model with Visibility. ICPR 2014: 3618-3623 - [c28]Takayuki Osogami, Makoto Otsuka:
Restricted Boltzmann machines modeling human choice. NIPS 2014: 73-81 - 2013
- [j16]Takayuki Osogami, Takashi Imamichi, Hideyuki Mizuta, Toyotaro Suzumura, Tsuyoshi Idé
Toward simulating entire cities with behavioral models of traffic. IBM J. Res. Dev. 57(5) (2013) - [j15]Takayuki Osogami, Rudy Raymond
Analysis of transient queues with semidefinite optimization. Queueing Syst. Theory Appl. 73(2): 195-234 (2013) - [c27]Takayuki Osogami, Rudy Raymond:
Map Matching with Inverse Reinforcement Learning. IJCAI 2013: 2547-2553 - [c26]Hiroki Yanagisawa, Takayuki Osogami:
Improved Integer Programming Approaches for Chance-Constrained Stochastic Programming. IJCAI 2013: 2938-2944 - [c25]Hiroki Yanagisawa, Takayuki Osogami, Rudy Raymond
Dependable virtual machine allocation. INFOCOM 2013: 629-637 - [c24]Tetsuro Morimura, Takayuki Osogami, Tsuyoshi Idé:
Solving inverse problem of Markov chain with partial observations. NIPS 2013: 1655-1663 - 2012
- [c23]Takayuki Osogami, Tetsuro Morimura:
Time-Consistency of Optimization Problems. AAAI 2012: 1945-1953 - [c22]Rudy Raymond, Tetsuro Morimura, Takayuki Osogami, Noriaki Hirosue:
Map matching with Hidden Markov Model on sampled road network. ICPR 2012: 2242-2245 - [c21]Takayuki Osogami:
Robustness and risk-sensitivity in Markov decision processes. NIPS 2012: 233-241 - [c20]Rikiya Takahashi, Takayuki Osogami, Tetsuro Morimura:
Large-Scale Nonparametric Estimation of Vehicle Travel Time Distributions. SDM 2012: 12-23 - [i1]Takayuki Osogami:
Iterated risk measures for risk-sensitive Markov decision processes with discounted cost. CoRR abs/1202.3755 (2012) - 2011
- [j14]Varun Gupta, Takayuki Osogami:
On Markov-Krein characterization of the mean waiting time in M/G/K and other queueing systems. Queueing Syst. Theory Appl. 68(3-4): 339-352 (2011) - [c19]Takayuki Osogami, Rudy Raymond
Simple bounds for a transient queue. DSN 2011: 562-573 - [c18]Varun Gupta, Takayuki Osogami:
Tight moments-based bounds for queueing systems. SIGMETRICS 2011: 133-134 - [c17]Takayuki Osogami:
Iterated risk measures for risk-sensitive Markov decision processes with discounted cost. UAI 2011: 573-580 - [c16]Shoko Suzuki, Takayuki Osogami:
Real-time data assimilation. WSC 2011: 625-636 - 2010
- [j13]Ryo Hirade, Takayuki Osogami:
Analysis of Page Replacement Policies in the Fluid Limit. Oper. Res. 58(4-Part-1): 971-984 (2010) - [j12]Takayuki Osogami:
Differentiating the performance of systems more reliably. Perform. Evaluation 67(10): 929-945 (2010) - [c15]Takayuki Osogami, Rudy Raymond
Semidefinite optimization for transient analysis of queues. SIGMETRICS 2010: 363-364
2000 – 2009
- 2009
- [j11]Takayuki Osogami:
Finding probably best systems quickly via simulations. ACM Trans. Model. Comput. Simul. 19(3): 12:1-12:19 (2009) - [c14]Takayuki Osogami:
A Fluid Limit for Cache Algorithms with General Request Processes. INFOCOM 2009: 2836-2840 - 2008
- [c13]Sei Kato, Takayuki Osogami:
Evaluating availability under quasi-heavy-tailed repair times. DSN 2008: 442-451 - 2007
- [j10]Takayuki Osogami:
Accuracy of measured throughputs and mean response times. SIGMETRICS Perform. Evaluation Rev. 35(2): 9-11 (2007) - [c12]Takayuki Osogami:
Relations in the Central Limit Theorem Version of the Response Time Law. QEST 2007: 69-78 - [c11]Takayuki Osogami, Sei Kato:
Optimizing system configurations quickly by guessing at the performance. SIGMETRICS 2007: 145-156 - 2006
- [j9]Takayuki Osogami, Mor Harchol-Balter
Closed form solutions for mapping general distributions to quasi-minimal PH distributions. Perform. Evaluation 63(6): 524-552 (2006) - [j8]Adam Wierman, Takayuki Osogami, Mor Harchol-Balter
How many servers are best in a dual-priority M/PH/k system? Perform. Evaluation 63(12): 1253-1272 (2006) - [j7]Takayuki Osogami:
Finding probably best system configurations quickly. SIGMETRICS Perform. Evaluation Rev. 34(3): 39-41 (2006) - [c10]Takayuki Osogami, Toshinari Itoko:
Finding probably better system configurations quickly. SIGMETRICS/Performance 2006: 264-275 - [c9]Takayuki Osogami:
Finding probably best systems quickly via simulation. WSC 2006: 2285 - 2005
- [j6]Takayuki Osogami, Mor Harchol-Balter
Analysis of cycle stealing with switching times and thresholds. Perform. Evaluation 61(4): 347-369 (2005) - [j5]Mor Harchol-Balter
Multi-Server Queueing Systems with Multiple Priority Classes. Queueing Syst. Theory Appl. 51(3-4): 331-360 (2005) - [j4]Mor Harchol-Balter
Robustness of threshold policies in beneficiary-donor model. SIGMETRICS Perform. Evaluation Rev. 33(2): 36-38 (2005) - [c8]Adam Wierman, Mor Harchol-Balter
Nearly insensitive bounds on SMART scheduling. SIGMETRICS 2005: 205-216 - 2004
- [j3]Takayuki Osogami, Adam Wierman, Mor Harchol-Balter, Alan Scheller-Wolf:
A recursive analysis technique for multi-dimensionally infinite Markov chains. SIGMETRICS Perform. Evaluation Rev. 32(2): 3-5 (2004) - 2003
- [j2]Takayuki Osogami, Hiroyuki Okano:
Local Search Algorithms for the Bin Packing Problem and Their Relationships to Various Construction Heuristics. J. Heuristics 9(1): 29-49 (2003) - [j1]Adam Wierman, Takayuki Osogami, Jörgen Olsén:
Modeling TCP-vegas under on/off traffic. SIGMETRICS Perform. Evaluation Rev. 31(2): 6-8 (2003) - [c7]Takayuki Osogami, Mor Harchol-Balter
Necessary and Sufficient Conditions for Representing General Distributions by Coxians. Computer Performance Evaluation / TOOLS 2003: 182-199 - [c6]Takayuki Osogami, Mor Harchol-Balter
A Closed-Form Solution for Mapping General Distributions to Minimal PH Distributions. Computer Performance Evaluation / TOOLS 2003: 200-217 - [c5]Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante:
Analysis of Task Assignment with Cycle Stealing under Central Queue. ICDCS 2003: 628- - [c4]Adam Wierman, Takayuki Osogami, Jörgen Olsén:
A Unified Framework for Modeling TCP-Vegas, TCP-SACK, and TCP-Reno. MASCOTS 2003: 269-278 - [c3]Takayuki Osogami, Mor Harchol-Balter
Analysis of cycle stealing with switching cost. SIGMETRICS 2003: 184-195 - [c2]Mor Harchol-Balter
Cycle stealing under immediate dispatch task assignment. SPAA 2003: 274-285 - 2000
- [c1]Takayuki Osogami, Hiroshi Imai:
Classification of Various Neighborhood Operations for the Nurse Scheduling Problem. ISAAC 2000: 72-83
Coauthor Index
aka: Rudy Raymond
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: