Výsledky vyhľadávania - "Parameterized algorithms"

A faster parameterized algorithm for temporal matching Autor Zschoche, Philipp

“…—describing a graph topology which is subject to discrete changes over time. A Δ-temporal matching M is a set of time edges (e…”
Získať plný text

Parameterized analysis and crossing minimization problems Autor Zehavi, Meirav

“…In this survey/introductory article, we first present the basics of the field of Parameterized Complexity, made accessible to readers without background on the subject…”
Získať plný text

Complexity of Secure Sets Autor Bliem, Bernhard, Woltran, Stefan

“… In this work, we pinpoint the complexity of this problem by showing that it is Σ 2 P -complete. Furthermore, the problem has so far not been subject to a parameterized complexity analysis that considers structural parameters…”
Získať plný text

Algorithms for Circuits and Circuits for Algorithms Autor Williams, Ryan

“…The title of this paper is meant to highlight an emerging duality between two fundamental topics in algorithms and complexity theory. Algorithms for circuits}…”
Získať plný text

A Faster Parameterized Algorithm for Temporal Matching Autor Zschoche, Philipp

“…A temporal graph is a sequence of graphs (called layers) over the same vertex set -- describing a graph topology which is subject to discrete changes over time. A \(\Delta\)-temporal matching \(M…”
Získať plný text

Minimization of an Integral Quadratic Estimate of the Controlled Variable in Systems with Distributed Parameters Autor Pleshivtseva, Yu. E., Rapoport, E. Ya

“…A constructive method for solving the linear-quadratic problem of the optimal control of a parabolic-type system with distributed parameters is proposed under…”
Získať plný text

Integration of the methods of algebra of algorithms and computational intelligence for automation of program systems design Autor A, Doroshenko, I, Sinitsyn, V, Shevchenko, O, Yatsenko, I, Achour

“…An approach to the creation of intelligent systems is considered, which combines the ideas of Glushkov’s algebra of algorithms with the well-known…”
Získať plný text

Answer Set Solving exploiting Treewidth and its Limits Autor Hecher, Markus

“…Parameterized algorithms have been subject to extensive research of recent years and allow to solve hard problems by exploiting a parameter of the corresponding problem instances…”
Získať plný text

Comparing Personal Image Collections with PICTuReVis Autor van der Corput, Paul, van Wijk, Jarke J.

“… Similar temporal and spatial patterns can be found using a parameterized algorithm, visualization is used to choose the right parameters and to inspect the patterns found…”
Získať plný text

Budgeted Matroid Maximization: a Parameterized Viewpoint Autor Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

“… in the \(\ell\)-matchoid a feasible set \(S\) of maximum profit \(p(S)\) subject to the budget constraint, i.e., \(c(S) \leq B\). The {\em budgeted \(\ell\)-matchoid} (BM…”
Získať plný text