Results 231 to 240 of about 46,397 (267)
Some of the next articles are maybe not open access.

Computer-generated conjectures(!) and proofs(!!) in combinatorial game theory (abstract only)

ACM Communications in Computer Algebra, 2008
The rapidly growing activity of experimental mathematics is still, to a large extent, a straightforward (albeit far-reaching) extension of the usual mode of paper-and-pencil research, where the pencil just got so much quicker and sharper and the paper so much larger.
Doron Zeilberger   +1 more
openaire   +1 more source

Symbolic-computational methods in combinatorial game theory and Ramsey theory

2008
This thesis is a contribution to the emerging fleld of experimental rigorous mathematics, where one uses symbolic computation to conjecture proof-plans, and then proceeds to verify the conjectured proofs rigorously. The proved results, in addition to their independent interest, should also be viewed as case studies in this budding methodology.
openaire   +1 more source

On some combinatorial problems arising in the theory of voting games

Mathematical Social Sciences, 1990
This paper complements the paper by the author and the reviewer [Int. J. Game Theory 19, No. 2, 111-127 (1990; Zbl 0726.90008)]. It gives the conditions on the size of the set of alternatives that guarantee the non- emptiness of the stability set for some quota voting games.
openaire   +2 more sources

Combining Combinatorial Game Theory with an α-β Solver for Domineering

2014
Combinatorial games are a special category of games sharing the property that the winner is by definition the last player able to move. To solve such games two main methods are being applied. The first is a general NegaScout search with many possible enhancements. This technique is applicable to every game, mainly limited to the size of the game due to
Barton, Michael, Uiterwijk, JWHM
openaire   +3 more sources

Combinatorial Game Theory Meets Deep Learning:Efficient Endgame Analysis

Journal of Go Studies
      The endgame stage of Go presents a unique challenge for scientific research. Contrary to previous stages, in the endgame the key to a successful analysis is board decomposition into smaller, independent local positions. Go players typically analyze these positions separately and prioritize moves based on their value.
openaire   +1 more source

Combining combinatorial game theory with an a-ß solver for CRAM

Belgian/Netherlands Artificial Intelligence Conference, 2018
Combinatorial games are a special category of games sharing the property that the winner is by definition the last player able to move. To solve such games two main methods are being applied. The first is a general a-ß search with many possible enhancements.
Uiterwijk, Jos W.H.M., Kroes, Lando
openaire   +1 more source

Horizontal gene transfer and adaptive evolution in bacteria

Nature Reviews Microbiology, 2021
Brian J Arnold, William P Hanage
exaly  

Combinatorial games in database theory

Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, 1995
openaire   +1 more source

Poly(ADP-Ribose) polymerase (PARP) inhibitors: Exploiting a synthetic lethal strategy in the clinic

Ca-A Cancer Journal for Clinicians, 2011
Timothy A Yap, Johann Sebastian de Bono
exaly  

Home - About - Disclaimer - Privacy