Iskanje po repozitoriju

Developing an Al Player for the Azul board game : final project paper
Aleksandra Zec, 2026, diplomsko delo

Ključne besede: Azul, minimax algorithm, alpha-beta pruning, heuristic evaluation function, adversarial search, game playing, artificial intelligence, zero-sum games, final project papers
Objavljeno v RUP: 08.08.2026; Ogledov: 108; Prenosov: 12
Celotno besedilo (8,75 MB)

A two-stage heuristic for the university course timetabling problem
Máté Pintér, Balázs Dávid, 2019, objavljeni znanstveni prispevek na konferenci

Ključne besede: university course timetabling, local search, heuristic
Objavljeno v RUP: 14.11.2019; Ogledov: 3652; Prenosov: 411
Povezava na celotno besedilo
Gradivo ima več datotek! Več...

Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Ademir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2017, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Objavljeno v RUP: 17.09.2018; Ogledov: 4824; Prenosov: 126
Povezava na celotno besedilo

Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Martin Milanič, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Objavljeno v RUP: 17.09.2018; Ogledov: 4214; Prenosov: 23
Povezava na celotno besedilo