Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 5
Pravice in dolžnosti sladkornih bolnikov
Jurij Fürst
Poljudni članek
Oznake: sladkorna bolezen;diabetiki;
Pravice in dolžnosti sladkornih bolnikov
Leto: 2003 Vir: Centralna tehniška knjižnica Univerze v Ljubljani (CTK)
Predpisovanje zdravil v letu 2006
Jurij Fürst, Vita Samaluk
Polemika, diskusijski prispevek
Oznake:
Leto: 2007 Vir: dLib.si Digitalna knjižnica Slovenije
Poraba anksiolitikov ter hipnotikov in sedativov v Sloveniji
Jurij Fürst, Jure Peklar, Vita Samaluk
Izvirni znanstveni članek
Oznake:
Background: Overprescribing of some psychoactive drugs can lead to tolerance, dependence and abuse. The purpose of this paper is to address the use of anxiolytics and hypnotics/sedatives in Slovenia, to compare the situation withthat in some other countries and to highlight the most interesting find ...
Leto: 2006 Vir: dLib.si Digitalna knjižnica Slovenije
ǂA ǂsymmetry-breaking node equivalence for pruning the search space in backtracking algorithms
Uroš Čibej, Luka Fürst, Jurij Mihelič
Izvirni znanstveni članek
Oznake: grafna ekvivalenca;razbijanje simetrij;sestopanje;iskanje monomorfizmov;rezanje iskalnega drevesa;algoritem na grafih;graph equivalence;symmetry breaking;backtracking;monomorphism search;search tree pruning;graph algorithm;
We introduce a new equivalence on graphs, defined by its symmetry-breaking capability. We first present a framework for various backtracking search algorithms, in which the equivalence is used to prune the search tree. Subsequently, we define the equivalence and an optimization problem with the goal ...
Leto: 2019 Vir: Fakulteta za računalništvo in informatiko (UL FRI)
Improved exact algorithm for finding a maximum exploratory equivalent partition
Lovro Sikošek, Uroš Čibej, Jurij Mihelič, Luka Fürst
Izvirni znanstveni članek
Oznake: teorija grafov;preiskovalna ekvivalenca;simetrija;avtomorfizem;izomorfizem;NP-težek;računska teorija grup;graph theory;exploratory equivalence;symmetry;automorphism;isomorphism;NP-hard;computational group theory;
An exploratory equivalent partition (EE partition) of a graph G with nontrivial automorphisms is a partition of its vertex set that can be directly translated into a set of constraints to speed up the search for occurrences of G in an arbitrary host graph. The maximum EE partition problem is to find ...
Leto: 2026 Vir: Fakulteta za računalništvo in informatiko (UL FRI)
Št. zadetkov: 5
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: