1. Developing an Al Player for the Azul board game : final project paperAleksandra Zec, 2026, undergraduate thesis Keywords: Azul, minimax algorithm, alpha-beta pruning, heuristic evaluation function, adversarial search, game playing, artificial intelligence, zero-sum games, final project papers Published in RUP: 08.08.2026; Views: 324; Downloads: 24
Full text (8,75 MB) |
2. |
3. |
4. |
5. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremAdemir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2017, published scientific conference contribution abstract Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Published in RUP: 17.09.2018; Views: 4926; Downloads: 126
Link to full text |
6. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremAdemir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2018, published scientific conference contribution abstract Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Published in RUP: 17.09.2018; Views: 4521; Downloads: 121
Full text (1,44 MB) This document has more files! More... |
7. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremMartin Milanič, 2018, published scientific conference contribution abstract (invited lecture) Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Published in RUP: 17.09.2018; Views: 4298; Downloads: 23
Link to full text |