Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Michael Kolonko"'
Publikováno v:
Mathematics and Computers in Simulation. 157:130-142
It is well-known that the quality of random number generators can often be improved by combining several generators, e.g. by summing or subtracting their results. In this paper we investigate the ratio of two random number generators as an alternativ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28dc7c4a9dfea82374b71ba10c9b941f
https://doi.org/10.1016/j.matcom.2018.10.002
https://doi.org/10.1016/j.matcom.2018.10.002
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030457174
The Collective Rearrangement (CR) algorithm is widely used for simulating packings of spheres to gain insight into many properties of granular matter. The quality of a CR simulation can be judged with a visualization technique by directly visualizing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::471b35abac80936cd02ece555d83855d
https://doi.org/10.1007/978-3-030-45718-1_9
https://doi.org/10.1007/978-3-030-45718-1_9
Publikováno v:
IEEE Transactions on Evolutionary Computation. 21:616-628
This paper analyzes the stochastic runtime of the cross-entropy (CE) algorithm for the well-studied standard problems OneMax and LeadingOnes. We prove that the total number of solutions the algorithm needs to evaluate before reaching the optimal solu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f8d47deeea31c34d2e9f0dbe9443e9c
https://doi.org/10.1109/tevc.2017.2667713
https://doi.org/10.1109/tevc.2017.2667713
Publikováno v:
Communications in Computer and Information Science ISBN: 9783319962702
The simulation of dry particle packings and their geometrical properties is of great importance to material sciences. Substantial acceleration of the simulation can be obtained using parallel hardware (GPU), but this requires specialized data structu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9c79bd80621a9e2f35b5d8e62ebcc3d
https://doi.org/10.1007/978-3-319-96271-9_6
https://doi.org/10.1007/978-3-319-96271-9_6
Autor:
Zijun Wu, Michael Kolonko
Publikováno v:
IEEE Transactions on Evolutionary Computation. 18:658-673
The discrete cross-entropy optimization algorithm iteratively samples solutions according to a probability density on the solution space. The density is adapted to the good solutions observed in the present sample before producing the next sample. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6bf91d4a9ef4d428907cac60e111a6f
https://doi.org/10.1109/tevc.2014.2336882
https://doi.org/10.1109/tevc.2014.2336882
Autor:
Michael Kolonko, S. Raschdorf
Publikováno v:
International Journal for Numerical Methods in Engineering. 85:625-639
Simulation of particle packings is an important tool in material science. Polydisperse mixtures require huge sample sizes to be representative. Simulation, in particular with iterative packing algorithms, therefore requires highly efficient data stru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9ef027dc37d33a3f85f54195e9a4054
https://doi.org/10.1002/nme.2988
https://doi.org/10.1002/nme.2988
Publikováno v:
Granular Matter. 12:629-643
In many fields of materials science it is important to know how densely a particle mixture can be packed. The “packing density” is the ratio of the particle volume and the volume of the surrounding container needed for a random close packing of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7119cd81197ff2c060f3bc1bd5af310
https://doi.org/10.1007/s10035-010-0216-5
https://doi.org/10.1007/s10035-010-0216-5
Publikováno v:
International Transactions in Operational Research. 11:381-394
We consider a network of periodically running railway lines. Investments are possible to increase the speed and to improve the synchronisation of trains. The model also includes random delays of trains and the propagation of delays across the network
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e811a9deb1de347af4336aa92789a4b2
https://doi.org/10.1111/j.1475-3995.2004.00465.x
https://doi.org/10.1111/j.1475-3995.2004.00465.x
Autor:
Björn Görder, Michael Kolonko
We want to select the best systems out of a given set of systems (or rank them) with respect to their expected performance. The systems allow random observations only and we assume that the joint observation of the systems has a multivariate normal d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa8d69c4ebe40f83dbbdd624d0a96615
http://arxiv.org/abs/1410.6782
http://arxiv.org/abs/1410.6782
Autor:
Michael Kolonko, Zijun Wu
Publikováno v:
IEEE Congress on Evolutionary Computation
Model-based search is an abstract framework that unifies the main features of a large class of heuristic procedures for combinatorial optimization, it includes ant algorithms, cross entropy and estimation of distribution algorithms. Properties shown
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24b6b2c5f5719ec7338845e785eeab94
https://doi.org/10.1109/cec.2014.6900307
https://doi.org/10.1109/cec.2014.6900307