• A Multilevel scheme for the Travelling Salesman Problem 

      Hjertenes, Øystein M. (Master thesis, 2002)
    • Multimedia i dynamisk presentasjons generator 2.0 

      Ingvaldsen, Bjørn Ove (Master thesis, 2008-10-01)
      Oppgaven omhandler en ny implementasjon av innholdshåndteringssystemet Dynamic Presetation Generator DPG, hvor hovedvekten av oppgaven tar for seg integrering av multimediafunksjonalitet i systemet.
    • MultiPath TCP-communication (in NorNet Core) 

      Ingebretsen, Kristian Bøckmann; Selvik, Daniel (Master thesis, 2016-05-31)
      Technology is constantly evolving, and we are currently witnessing a digital revolution with a tremendous growth of interconnected devices. The scale of the Internet and the amount of transported data is constantly increasing. ...
    • Multiple Side Linear Equations. A New Tool For Solving Sparse Algebraic Equations in Finite Field 

      Renzengwangdui, X (Master thesis, 2010-01-28)
      A new technique of linearization for sparse multivariate polynomial equation system is presented. Applying Gluing algorithm on the newly constructed linear equation systems, therefore solve the original multivariate ...
    • Multiple time–scale dynamics of stage structured populations and derivative–free optimization 

      Schaarschmidt, Ute Alexandra (Doctoral thesis, 2018-11-02)
      The parent-progeny (adult fish–juvenile) relationship is central to understanding the dynamics of fish populations. Management and harvest decisions are based on the assumption of a stock-recruitment function that relates ...
    • Multiscale Visual Drilldown for the Analysis of Large Ensembles of Multi-Body Protein Complexes 

      Furmanová, Katarína; Jurčík, Adam; Kozlíková, Barbora; Hauser, Helwig; Byska, Jan (Journal article; Peer reviewed, 2020)
      When studying multi-body protein complexes, biochemists use computational tools that can suggest hundreds or thousands of their possible spatial configurations. However, it is not feasible to experimentally verify more ...
    • Multivariate Algorithmic Analysis of Hitting Small Sets 

      Kumar, Mithilesh (Doctoral thesis, 2017-05-29)
      When a problem has been shown to be NP-complete, often one has to be content with either exponential-time algorithms or resort to approximation algorithms that sacrifice the optimality of the solution, or with ad hoc ...
    • Naive and adapted utilization of the GPU for general purpose computing 

      Mjøs, Alexander (Master thesis, 2017)
      In this thesis we will see that adaptive utilization of the graphical processing unit (GPU) has much better performance than naive utilization, but it takes longer time to implement and requires more knowledge about ...
    • Naturlige nettverk 

      Vatshelle, Martin (Master thesis, 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 ...
    • Network coding in Bluetooth networks 

      Stenvoll, Roger (Master thesis, 2009-10-01)
      This thesis discusses the possibility to apply network coding to a Bluetooth piconet. A protocol is proposed. This protocol is based on using deterministic linear network coding. The proposed alphabet size is binary, and ...
    • A New Family of APN Quadrinomials 

      Budaghyan, Lilya; Helleseth, Tor; Kaleyski, Nikolay Stoyanov (Journal article; Peer reviewed, 2020)
      The binomial B(x) = x 3 +βx 36 (where β is primitive in F 2 2) over F 2 10 is the first known example of an Almost Perfect Nonlinear (APN) function that is not CCZ-equivalent to a power function, and has remained unclassified ...
    • A New Generating Set Search Algorithm for Partially Separable Functions 

      Frimannslund, Lennart; Steihaug, Trond (ADVCOMP 2010 : The Fourth International Conference on Advanced Engineering Computing and Applications in Sciences, Conference object; Peer reviewed, 2010)
      A new derivative-free optimization method for unconstrained optimization of partially separable functions is presented. Using average curvature information computed from sampled function values the method generates an ...
    • New Lower Bounds on the Maximum Number of Minimal Connected Vertex Covers 

      Ryland, Ida (Master thesis, 2017-06-20)
      Graphs are important mathematical structures that are used to model many real-life problems. They can, for instance, be used to model relations between objects in a network. An important field of study in graph theory is ...
    • New Results on Minimal Triangulations 

      Villanger, Yngve (Doctoral thesis, 2006-04-25)
    • New Width Parameters of Graphs 

      Vatshelle, Martin (Doctoral thesis, 2012-09-03)
      The main focus of this thesis is on using the divide and conquer technique to efficiently solve graph problems that are in general intractable. We work in the field of parameterized algorithms, using width parameters of ...
    • Newsenhancer 

      Nerdal, Sindre Lilland (Master thesis, 2018-08-23)
      This thesis describes a web browser plugin called NewsEnhancer, which has the goal to make it more efficient to read the news. The plugin receives data from a server application, which continuously aggregates meta information ...
    • Non-Constructivity in Kan Simplicial Sets 

      Bezem, Marc; Coquand, Thierry; Parmann, Erik (Conference object; Peer reviewed, 2015)
      We give an analysis of the non-constructivity of the following basic result: if X and Y are simplicial sets and Y has the Kan extension property, then Y X also has the Kan extension property. By means of Kripke countermodels ...
    • Nonlinear feedback shift registers and generating of binary de Bruijn sequences 

      Vivelid, Christian Ebne (Master thesis, 2016-11-21)
    • Norwegian e-Infrastructure for Life Sciences (NeLS) 

      Tekle, Kidane M; Gundersen, Sveinung; Klepper, Kjetil; Bongo, Lars Ailo; Raknes, Inge Alexander; Li, Xiaxi; Zhang, Wei; Andreetta, Christian; Mulugeta, Teshome Dagne; Kalaš, Matúš; Rye, Morten Beck; Hjerde, Erik; Antony Samy, Jeevan Karloss; Fornous, Ghislain; Azab, Abdulrahman; Våge, Dag Inge; Hovig, Eivind; Willassen, Nils Peder; Drabløs, Finn; Nygård, Ståle; Petersen, Kjell; Jonassen, Inge (Peer reviewed; Journal article, 2018)
      The Norwegian e-Infrastructure for Life Sciences (NeLS) has been developed by ELIXIR Norway to provide its users with a system enabling data storage, sharing, and analysis in a project-oriented fashion. The system is ...
    • A Note on Exact Algorithms for Vertex Ordering Problems on Graphs 

      Bodlaender, Hans L.; Fomin, Fedor; Koster, Arie M.C.A.; Kratsch, Dieter; Thilikos, Dimitrios M. (Peer reviewed; Journal article, 2011-01-21)
      In this note, we give a proof that several vertex ordering problems can be solved in O ∗(2 n ) time and O ∗(2 n ) space, or in O ∗(4 n ) time and polynomial space. The algorithms generalize algorithms for the Travelling ...