Schöne neue Datenwelt Ob Kaufverhalten, Grippewellen oder welche Farbe am ehesten verrät, ob ein Gebrauchtwagen in einem guten Zustand ist–noch nie gab es eine solche …
In this article we present an overview on the state of the art in games solved in the domain of two-person zero-sum games with perfect information. The results are summarized and some …
K Proedrou, I Nouretdinov, V Vovk… - Machine Learning: ECML …, 2002 - Springer
We propose a new algorithm for pattern recognition that outputs some measures of “reliability” for every prediction made, in contrast to the current algorithms that output “bare” …
Proving geometric theorems constitutes a hallmark of visual reasoning combining both intuitive and logical skills. Therefore, automated theorem proving of Olympiad-level …
We study two dimensions of complexity that may interfere with individual choice. The first one is object complexity, which corresponds to the difficulty in evaluating any given …
Proof-Number (PN) search is a best-first adversarial search algorithm especially suited for finding the game-theoretical value in game trees. The strategy of the algorithm may be …
U Rückert, S Kramer - Proceedings of the 20th international conference …, 2003 - cdn.aaai.org
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and …
One of the best examples of a zero-sum perfect information game is chess. Aesthetics is an important part of it that is greatly appreciated by players. Computers are currently able to …
One of the earliest dreams of the fledgling field of artificial intelligence (AI) was to build computer programs that could play games as well as or better than the best human players …