default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHideaki Yamashita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c4]Nobuhiko Kondo, Takeshi Matsuda, Yuji Hayashi, Hideya Matsukawa, Mio Tsubakimoto, Yuki Watanabe, Shinji Tateishi, Hideaki Yamashita:
Academic Success Prediction based on Important Student Data Selected via Multi-objective Evolutionary Computation. IIAI-AAI 2020: 370-373
2010 – 2019
- 2019
- [j9]Masayuki Maeda
, Hideaki Yamashita:
A numerical approach for a discrete Markov model for progressing drug resistance of cancer. PLoS Comput. Biol. 15(2) (2019)
2000 – 2009
- 2006
- [j8]Hideaki Yamashita, Yo Ishizuka, Shigemichi Suzuki:
Mean and variance of waiting time and their optimization for alternating traffic control systems. Math. Program. 108(2-3): 419-433 (2006)
1990 – 1999
- 1997
- [c3]Hideaki Yamashita:
Delay and overflow of discrete-time priority queue with burst arrivals and partial buffer sharing. PMCCN 1997: 59-74 - 1995
- [j7]On Hashida, Yoshitaka Takahashi, Hideaki Yamashita:
Performance Models for Information Communication Networks. Perform. Evaluation 23(2): 91-92 (1995) - [c2]Johan M. Karlsson, Hideaki Yamashita:
Discrete-time analysis of a finite capacity queue with an "all or nothing policy" to reduce burst loss. Data Communications and their Performance 1995: 179-193 - 1994
- [j6]Hideaki Yamashita, Raif O. Onvural:
Allocation of buffer capacities in queueing networks with arbitrary topologies. Ann. Oper. Res. 48(4): 313-332 (1994) - [j5]Hideaki Yamashita:
Numerical analysis of a discrete-time finite capacity queue with a burst arrival. Ann. Oper. Res. 49(1): 101-110 (1994) - [j4]Dooyeong Park, Harry G. Perros, Hideaki Yamashita:
Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss. Oper. Res. Lett. 15(2): 95-104 (1994) - [j3]Hideaki Yamashita:
Discrete-time analysis of a classified multi-server queue with burst arrivals and a shared buffer. Queueing Syst. Theory Appl. 18(1-2): 167-182 (1994) - 1993
- [j2]S. Hong, Harry G. Perros, Hideaki Yamashita:
A discrete-time queueing model of the shared buffer ATM switch with bursty arrivals. Telecommun. Syst. 2(1): 1-20 (1993) - [c1]Hideaki Yamashita, Raif O. Onvural:
On the Cel Loss Distribution of Protocol Data Units in ATM Networks. Data Communication Networks and their Performance 1993: 183-197
1980 – 1989
- 1988
- [j1]Hideaki Yamashita, Shigemichi Suzuki:
An approximation method for line production rate of a serial production line with a common buffer. Comput. Oper. Res. 15(5): 395-402 (1988)
Coauthor Index
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-04-25 05:55 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:
