Now showing items 101-110 of 355
Diagram Predicate Framework meets Model Versioning and Deep Metamodelling
(The University of Bergen, 2011-12-07)
Model-driven engineering (MDE) is a branch of software engineering which aims at improving the productivity, quality and cost-effectiveness of software by shifting the paradigm from code-centric to model-centric. MDE ...
Randomised Construction and Dynamic Decoding of LDPC Codes
(The University of Bergen, 2005-11-30)
(The University of Bergen, 2008)
En innføring i naturlige nettverk. Vi forklarer og diskuterer begrepet naturlige nettverk og vurderer hvilke nettverk som bør kalles naturlige. Vi ser på forskjeller og likheter mellom tilfeldige, planlagte og naturlige ...
Exponential time algorithms: Structures, measures, and bounds
(The University of Bergen, 2008-12-05)
This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running ...
Dynamic Content Manager for E-Learning
(The University of Bergen, 2008-11-18)
Dynamic content manager for E-Learning project is developed as the partial fulfillment of master studies under the supervision of yngve lamo Ph.D and Khalid Azim Mughal Ph.D.
Støtte for Geodata i Dynamic Presentation Generator
(The University of Bergen, 2012-01-27)
Predicting Gene Regulatory Elements in Silico on a Genomic Scale
(Cold Spring Harbor Laboratory Press, 1998-05-18)
We performed a systematic analysis of gene upstream regions in the yeast genome for occurrences of regular expression-type patterns with the goal of identifying potential regulatory elements. To achieve this goal, we have ...
Generalized Bent and/or Negabent Constructions
(The University of Bergen, 2012-04-27)
In this thesis, we generalize the Maiorana-McFarland construction for bent, negabent and bent-negabent Boolean functions and describe a way to computationally search for constructions using these generalizations. We present ...
Designing Subexponential Algorithms: Problems, Techniques & Structures
(The University of Bergen, 2007-09-14)
In this thesis we focus on subexponential algorithms for NP-hard graph problems: exact and parameterized algorithms that have a truly subexponential running time behavior. For input instances of size n we study exact ...
Type Systems for Guaranteeing Resource Bounds of Component Software
(The University of Bergen, 2006-05-15)
Since the early days of the development of programming languages, people have been developing various methods to reduce the runtime errors of software programs. These methods range from static analysis, testing to runtime ...