Blar i Bergen Open Research Archive på tittel
Viser treff 24342-24361 av 35892
-
Parallel Graph Algorithms for Combinatorial Scientific Computing
(Doctoral thesis, 2011-08-26) -
Parallel Matching and Clustering Algorithms on GPUs
(Doctoral thesis, 2017-06-17) -
Parameter calibration of a system dynamics model. A comparison of three evolutionary algorithms
(Master thesis, 2013-07-31)This research seeks to improve the parameter calibration process of a System Dynamics model. A movie release strategies" model has been developed in 2012 using a gradient-based optimization algorithm to estimate all the ... -
Parameter Estimation of Multivariate Factor Stochastic Volatility Models
(Master thesis, 2018-06-22)Volatility is a crucial aspect of risk management and important to accurately quantify. A broad range of models and methods tackle this problem, but there is no consensus to exactly which method or model that solves this ... -
Parameter estimation of network structures with application to vascular networks
(Master thesis, 2022-11-21)The complex and hierarchical structure of the vascular system constitutes a main challenge in blood flow modelling, to which multiscale modelling has been a common approach. Recent publications suggest to represent large ... -
Parameter Estimation Solving a Weak Constraint Variational Formulation for an Ekman Model
(Journal article, 1997-06-15)A weak constraint variational formulation is used for inverse calculations and parameter estimation in a one-dimensional Ekman model. When parameters in the model are allowed to contain errors, the inverse problem becomes ... -
Parameter estimation with the augmented Lagrangian method for a parabolic equation.
(Department of Applied Mathematics report, Research report, 2001-01) -
Parameter optimisation for the improved modelling of industrial-scale gas explosions
(Doctoral thesis, 2019-06-17)This thesis presents work on improving the predictive capabilities of a numerical model by parameter optimisation. The numerical model is based on computational fluid dynamics (CFD) and predicts the consequences of ... -
Parameter Scans and Machine Learning for beyond Standard Model Physics
(Doctoral thesis, 2019-05-02)This thesis focuses on different beyond Standard Model theories, and the use of statistical methods to investigate them. Supersymmetry is considered in different contexts. First, the supersymmetry breaking scheme of gaugino ... -
Parameterization Above a Multiplicative Guarantee
(Journal article; Peer reviewed, 2020)Parameterization above a guarantee is a successful paradigm in Parameterized Complexity. To the best of our knowledge, all fixed-parameter tractable problems in this paradigm share an additive form defined as follows. Given ... -
Parameterization of drag and dissolution of rising CO2 drops in seawater
(Journal article, 2005-05-24)In this work the dynamics and dissolution of a hydratecovered CO2 drop were studied, using a numeric model and data from one of very few CO2 experiments performed in the real ocean. A theory including the standard drag ... -
Parameterized complexity classification of deletion to list matrix-partition for low-order matrices
(Journal article; Peer reviewed, 2019)Given a symmetric l x l matrix M=(m_{i,j}) with entries in {0,1,*}, a graph G and a function L : V(G) - > 2^{[l]} (where [l] = {1,2,...,l}), a list M-partition of G with respect to L is a partition of V(G) into l parts, ... -
Parameterized Complexity of Broadcasting in Graphs
(Journal article; Peer reviewed, 2023)The task of the broadcast problem is, given a graph G and a source vertex s, to compute the minimum number of rounds required to disseminate a piece of information from s to all vertices in the graph. It is assumed that, ... -
Parameterized complexity of categorical clustering with size constraints
(Journal article; Peer reviewed, 2023) -
Parameterized complexity of conflict-free matchings and paths
(Journal article; Peer reviewed, 2019)An input to a conflict-free variant of a classical problem Gamma, called Conflict-Free Gamma, consists of an instance I of Gamma coupled with a graph H, called the conflict graph. A solution to Conflict-Free Gamma in (I,H) ... -
Parameterized Complexity of Directed Spanner Problems
(Journal article; Peer reviewed, 2020)We initiate the parameterized complexity study of minimum t-spanner problems on directed graphs. For a positive integer t, a multiplicative t-spanner of a (directed) graph G is a spanning subgraph H such that the distance ... -
Parameterized Complexity of Directed Spanner Problems
(Journal article; Peer reviewed, 2021)We initiate the parameterized complexity study of minimum t-spanner problems on directed graphs. For a positive integer t, a multiplicative t-spanner of a (directed) graph G is a spanning subgraph H such that the distance ... -
Parameterized complexity of Eulerian deletion problems
(Peer reviewed; Journal article, 2014-01)We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity ... -
Parameterized Complexity of Fair Graph Clustering
(Master thesis, 2022-08-29)The problem of $\alpha-$ \textsl{BALANCED CLUSTER VERTEX DELETION} where \(\alpha \geq 1 \) is some constant, asks whether it is possible to delete at most \(k\) vertecies from a vertex colored graph such that that it ... -
Parameterized Complexity of Feature Selection for Categorical Data Clustering
(Journal article; Peer reviewed, 2021)We develop new algorithmic methods with provable guarantees for feature selection in regard to categorical data clustering. While feature selection is one of the most common approaches to reduce dimensionality in practice, ...