Showing 1 - 10 of 177,512
Mastermind is a two players zero sum game of imperfect information. Starting with Erdos and Rényi (1963), its combinatorics have been studied to date by several authors, e.g., Knuth (1977), Chvátal (1983), Goodrich (2009). The first player, called “codemaker”, chooses a secret code and the...
Persistent link: https://www.econbiz.de/10011771356
Persistent link: https://www.econbiz.de/10011805564
Prefetching is a simple and general method for single-chain parallelisation of the Metropolis-Hastings algorithm based … random walk Metropolis-Hastings algorithm is obtained for a special case and it is shown to decrease in the number of …
Persistent link: https://www.econbiz.de/10003779724
Persistent link: https://www.econbiz.de/10003275915
Persistent link: https://www.econbiz.de/10003861027
various ways. The core algorithm determines the generality of terms and iteratively inserts them in a growing taxonomy …. Variants of the algorithm are created by altering the way and the frequency, generality of terms is calculated. We analyse the …
Persistent link: https://www.econbiz.de/10003888892
Persistent link: https://www.econbiz.de/10008663654
that our approach and the NFXP algorithm solve the same estimation problem, and yield the same estimates. Computationally …
Persistent link: https://www.econbiz.de/10008665893
Persistent link: https://www.econbiz.de/10003977186
. Therefore a combinatorial optimisation algorithm is developed and an algorithm based on graph search is used and customised … correctness of the quick combinatorial algorithm are proved within this paper. For vehicle to grid (V2G) concepts, battery … been used to include degradation costs for different LiIon batteries into the graph search algorithm. An application of …
Persistent link: https://www.econbiz.de/10003954045