Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Stefan Arnborg"'
Autor:
Andrzej Proskurowski, Stefan Arnborg
Publikováno v:
Treewidth, Kernels, and Algorithms ISBN: 9783030420703
Treewidth, Kernels, and Algorithms
Treewidth, Kernels, and Algorithms
The idea of applying a dynamic programming strategy to evaluating certain objective functions on trees is fairly straightforward. The road for this idea to develop into theories of width parameters has been not so straight. Hans Bodlaender has played
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad7bcf6c07227a5e04f9ec5be7a9af66
https://doi.org/10.1007/978-3-030-42071-0_1
https://doi.org/10.1007/978-3-030-42071-0_1
Autor:
Stefan Arnborg
Publikováno v:
International Journal of Approximate Reasoning. 78:1-14
In Robust Bayesian analysis one attempts to avoid the ‘Dogma of Precision’ in Bayesian analysis by entertaining a set of probability distributions instead of exactly one. The algebraic approach to plausibility calculi is inspired by Cox's and Jay
Publikováno v:
Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability. 226:96-108
In the long-term and operational planning of the power transmission system (PTS), one challenge is to identify components critical to system reliability. In this paper, the importance of each component for system reliability and vulnerability are qua
Publikováno v:
IEEE Transactions on Power Systems. 13:395-400
This paper explores the influence of load models on decisions of undervoltage load shedding in power systems. A controlled load rejection can be used as an emergency countermeasure to avoid widespread blackout when system voltages are unstable. In th
Publikováno v:
International Journal of Electrical Power & Energy Systems. 19:141-149
This paper presents an analytical basis and criterion for undervoltage load shedding in power systems. If the voltage is unstable, the proposed undervoltage load shedding criterion can be used to calculate the amount of load which must be shed to sta
Publikováno v:
Journal of the ACM. 40:1134-1164
We show how membership in classes of graphs definable in monadic second order logic and of bounded treewidth can be decided by finite sets of terminating reduction rules. The method is constructive in the sense that we describe an algorithm which wil
Autor:
Stefan Arnborg
Publikováno v:
Journal of Experimental & Theoretical Artificial Intelligence. 5:335-357
We show how the theory of decomposable graphs can be used for reasoning methods involving a more refined analysis of models (in the logic sense) than classical reasoning. We introduce a directed binary graph representation of event structures. This r
Autor:
Stefan Arnborg, Andrzej Proskurowski
Publikováno v:
BIT. 32:197-214
We give algorithms constructing canonical representations of partial 2-trees (series parallel graphs) and partial 3-trees. The algorithms can be implemented in log-linear space, or in linear time using quadratic space.
Publikováno v:
2009 IEEE Bucharest PowerTech.
In the planning of the electrical transmission system it is of greatest concern to quantify the security margin for unwanted conditions in the system. This paper proposes an approach based on quantifying the risk of insufficient transmission capacity
Publikováno v:
Journal of Algorithms. 12:308-340
Using a variation of the interpretability concept we show that all graph properties definable in monadic second-order logic (MS properties) with quantification over vertex and edge sets can be decided in linear time for classes of graphs of fixed bou