Zobrazeno 1 - 10
of 2 654
pro vyhledávání: '"Jež, P."'
In the online disjoint set covers problem, the edges of a hypergraph are revealed online, and the goal is to partition them into a maximum number of disjoint set covers. That is, n nodes of a hypergraph are given at the beginning, and then a sequence
Externí odkaz:
http://arxiv.org/abs/2404.15554
Parikh's Theorem is a fundamental result in automata theory with numerous applications in computer science: software verification (e.g. infinite-state verification, string constraints, and theory of arrays), verification of cryptographic protocols (e
Externí odkaz:
http://arxiv.org/abs/2311.03901
Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which permit a we
Externí odkaz:
http://arxiv.org/abs/2308.00175
We give algorithms that, given a straight-line program (SLP) with $g$ rules that generates (only) a text $T [1..n]$, builds within $O(g)$ space the Lempel-Ziv (LZ) parse of $T$ (of $z$ phrases) in time $O(n\log^2 n)$ or in time $O(gz\log^2(n/z))$. We
Externí odkaz:
http://arxiv.org/abs/2212.02327
Publikováno v:
Ekonomika Poljoprivrede (1979), Vol 71, Iss 3 (2024)
Sustainable rural development, encompassing economic growth, social equity, and environmental protection, is a multifaceted concept with inherent complexities. Achieving it often involves navigating trade-offs between these three pillars. To effectiv
Externí odkaz:
https://doaj.org/article/bfad63994e744344a66b00070854ffde
We prove new lower bounds for suitable competitive ratio measures of two relaxed online packing problems: online removable multiple knapsack, and a recently introduced online minimum peak appointment scheduling problem. The high level objective in bo
Externí odkaz:
http://arxiv.org/abs/2201.05999
Autor:
Ferens, Robert, Jeż, Artur
A word equation with one variable in a free group is given as $U = V$, where both $U$ and $V$ are words over the alphabet of generators of the free group and $X, X^{-1}$, for a fixed variable $X$. An element of the free group is a solution when subst
Externí odkaz:
http://arxiv.org/abs/2101.06201
Autor:
Januška Gostenčnik, Karmen Kenda-Jež
Publikováno v:
Jezikoslovni zapiski, Vol 29, Iss 2, Pp 287–313-287–313 (2023)
V prispevku je prikazan govor kraja Gomilica (SLA T392), ki je dolinski govor (z nekaterimi značilnostmi ravenskega govora) prekmurskega narečja panonske narečne skupine. Opisane so osnovne glasoslovne in naglasoslovne značilnosti. Fonološki opi
Externí odkaz:
https://doaj.org/article/b17471aa9db04addbbb8d78defb318c3
We study the resource augmented version of the $k$-server problem, also known as the $k$-server problem against weak adversaries or the $(h,k)$-server problem. In this setting, an online algorithm using $k$ servers is compared to an offline algorithm
Externí odkaz:
http://arxiv.org/abs/1911.01592
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.