1,884 research outputs found
Europe's moral beliefs
No full textCITATION: Halman, L. 2000. Europe's moral beliefs. Scriptura, 75, doi:10.7833/75-0-1263.The original publication is available at https://scriptura.journals.ac.zaNo abstract available
Peter Halman Monsma, Karl Barth's Idea of Revelation
No full textGoossens Werner. Peter Halman Monsma, Karl Barth's Idea of Revelation. In: Revue néo-scolastique de philosophie. 42ᵉ année, Deuxième série, n°61, 1939. pp. 135-136
Thesaurus antiquitatum romanorum
No full textPort. a dos tintas con grab. xilTexto a dos colSign.: A-5Y\p4\sPort. a 2 tintas con grab. xilTexto a 2 colGrab. xil. intercalados en el text
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games are all LP-Type Problems
No full textWe show that a Simple Stochastic Game (SSG) can be formulated as an LP-type problem. Using this formulation, and the known algorithm of Sharir and Welzl for LP-type problems, we obtain the first strongly subexponential solution for SSGs (a strongly subexponential algorithm has only been known for binary SSGs).
Using known reductions between various games, we achieve the first trongly subexponential solutions for Discounted and Mean Payoff Games. We also give alternative simple proofs for the best known upper bounds for Parity Games and binary SSGs.
To the best of our knowledge, the LP-type framework has been used so far only in order to yield linear or close to linear time algorithms for various problems in computational geometry and location theory. Our approach demonstrates the applicability of the LP-type framework in other fields, and for achieving subexponential algorithms.
This work has been published in Algorithmica, volume 49 (September 2007), pages 37-5
A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy
No full textGiven n elements with nonnegative integer weights w=(w_1,...,w_n), an integer capacity C and positive integer ranges u=(u_1,...,u_n), we consider the counting version of the classic integer knapsack problem: find the number of distinct multisets whose weights add up to at most C. We give a deterministic algorithm that estimates the number of solutions to within relative error epsilon in time polynomial in n, log U and 1/epsilon, where U=max_i u_i. More precisely, our algorithm runs in O((n^3 log^2 U)/epsilon) log (n log U)/epsilon) time. This is an improvement of n^2 and 1/epsilon (up to log terms) over the best known deterministic algorithm by Gopalan et al. [FOCS, (2011), pp. 817-826]. Our algorithm is relatively simple, and its analysis is rather elementary. Our results are achieved by means of a careful formulation of the problem as a dynamic program, using the notion of binding constraints
Supplementary information for the "Accuracy of short tandem repeats genotyping tools in whole exome sequencing data" article
No full textSupplementary information for the "Accuracy of short tandem repeats genotyping tools in whole exome sequencing data" articl
Contemporary European religious beliefs and practices
No full textCITATION: Halman, L. 2000. Contemporary European religious beliefs and practices. Scriptura, 75:359-386, doi:10.7833/75-0-1262.The original publication is available at http://scriptura.journals.ac.zaIt is often said that in Europe religion has lost a substantial part of its former significant impact on human life, and often evidence for the assumed religious decline is found in the low levels of church attendance. However, such figures of declining church attendance do not necessarily reveal a religious decline in the sense of religious beliefs.http://scriptura.journals.ac.za/pub/article/view/1262Publisher's versio
- …
