default search action
Ad Ridder
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j19]Shaul K. Bar-Lev, Ad Ridder
:
Exponential dispersion models for overdispersed zero-inflated count data. Commun. Stat. Simul. Comput. 52(7): 3286-3304 (2023) - 2022
- [j18]Ad Ridder
Rare-event analysis and simulation of queues with time-varying rates. Queueing Syst. Theory Appl. 100(3-4): 545-547 (2022) - 2020
- [j17]Anne van den Broek d'Obrenan, Ad Ridder
Minimizing bed occupancy variance by scheduling patients under uncertainty. Eur. J. Oper. Res. 286(1): 336-349 (2020)
2010 – 2019
- 2017
- [c6]Ben Cohen, Ad Ridder
A simulation tool for truck loading at fuel filling plants. WSC 2017: 3102-3113 - 2016
- [j16]Zdravko I. Botev, Ad Ridder
Semiparametric cross entropy for rare-event simulation. J. Appl. Probab. 53(3): 633-649 (2016) - [j15]Radislav Vaisman
Sequential Monte Carlo for counting vertex covers in general graphs. Stat. Comput. 26(3): 591-607 (2016) - [c5]Zdravko I. Botev, Ad Ridder:
An M-estimator for rare-event probability estimation. WSC 2016: 359-369 - 2015
- [c4]Zdravko I. Botev, Michel Mandjes, Ad Ridder
Tail distribution of the maximum of correlated gaussian random variables. WSC 2015: 633-642 - 2012
- [c3]Bruno Tuffin, Ad Ridder
Probabilistic bounded relative error for rare event simulation learning techniques. WSC 2012: 40:1-40:12 - 2011
- [j14]Ad Ridder
State-dependent importance sampling schemes via minimum cross-entropy. Ann. Oper. Res. 189(1): 357-388 (2011) - [j13]Arno Berger, Theodore P. Hill, Bahar Kaynar, Ad Ridder
Finite-state Markov Chains Obey Benford's Law. SIAM J. Matrix Anal. Appl. 32(3): 665-684 (2011) - 2010
- [j12]Bahar Kaynar, Ad Ridder
The cross-entropy method with patching for rare-event simulation of large Markov chains. Eur. J. Oper. Res. 207(3): 1380-1397 (2010) - [c2]Ad Ridder
Asymptotic optimality of the cross-entropy method for Markov chain problems. ICCS 2010: 1571-1578 - [i1]Chris Dietz, Dinard van der Laan, Ad Ridder:
Approximate results for a generalized secretary problem. CoRR abs/1009.0626 (2010)
2000 – 2009
- 2009
- [j11]Ad Ridder
Importance sampling algorithms for first passage time probabilities in the infinite server queue. Eur. J. Oper. Res. 199(1): 176-186 (2009) - 2007
- [j10]Ad Ridder
Minimum Cross-entropy Methods for Rare-event Simulation. Simul. 83(11): 769-784 (2007) - 2005
- [j9]Ad Ridder
Importance Sampling Simulations of Markovian Reliability Systems Using Cross-Entropy. Ann. Oper. Res. 134(1): 119-136 (2005) - [j8]Ad Ridder
Large deviations without principle: join the shortest queue. Math. Methods Oper. Res. 62(3): 467-483 (2005) - 2002
- [j7]Michel Mandjes, Ad Ridder
A large deviations analysis of the transient of a queue with many Markov fluid inputs: approximations and fast simulation. ACM Trans. Model. Comput. Simul. 12(1): 1-26 (2002) - 2001
- [j6]Michel Mandjes, Ad Ridder
A large deviations approach to the transient of the Erlang loss model. Perform. Evaluation 43(2-3): 181-198 (2001) - 2000
- [j5]Ronald Korporaal, Ad Ridder
An analytic model for capacity planning of prisons in the Netherlands. J. Oper. Res. Soc. 51(11): 1228-1237 (2000)
1990 – 1999
- 1999
- [j4]Michel Mandjes, Ad Ridder
Optimal trajectory to overflow in a queue fed by a large number of sources. Queueing Syst. Theory Appl. 31(1-2): 137-170 (1999) - 1998
- [j3]Ad Ridder
How Larger Demand Variability May Lead to Lower Costs in the Newsvendor Problem. Oper. Res. 46(6): 934-936 (1998) - 1995
- [j2]Ad Ridder
Weak stochastic ordering for multidimensional Markov chains. Oper. Res. Lett. 18(3): 121-126 (1995) - [j1]Costas Courcoubetis, George Kesidis, Ad Ridder
Admission control and routing in ATM networks using inferences from measured buffer occupancy. IEEE Trans. Commun. 43(2/3/4): 1778-1784 (1995)
1980 – 1989
- 1987
- [c1]Arie Hordijk, Ad Ridder:
Approximating Sensitive Queueing Networks by Reversible Markov Chains. Computer Performance and Reliability 1987: 105-117
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-10-30 20:25 CET 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: