Opin vísindi

Fletta eftir sviði "School of Computer Science (RU)"

Fletta eftir sviði "School of Computer Science (RU)"

Röðun: Raða: Niðurstöður:

  • Losievskaja, Elena (Háskólinn í Reykjavík, 2011-01-24)
    This thesis deals with approximation algorithms for the Maximum Independent Set and the Minimum Hitting Set problems on hypergraphs. As a hypergraph is a generalization of a graph, the question is whether the best known approximations on graphs can be ...
  • Goriac, Eugen Ioan (Háskólinn í Reykjavík, 2013-03-24)
    Structural Operational Semantics (SOS) is a well known standard for specifying language semantics in a natural, yet rigorous way. Once a formal way of checking for the equivalence of two programs written in such a language is provided, it is of great ...
  • Caltais, Georgiana (Háskólinn í Reykjavík, 2014-04-10)
    One of the research areas of great importance in Computer Science is the study of the semantics of concurrent reactive systems. These are systems that compute by interacting with their environment, and typically consist of several parallel components, ...
  • Cimini, Matteo (Háskólinn í Reykjavík, 2012-12-09)
    Structural Operational Semantics (SOS) is one of the most natural ways for providing programming languages with a formal semantics. Results on the meta-theory of SOS typically (but not solely) say that if the inference rules used in writing the semantic ...
  • Bean, Christian (2018-06)
    New automatic methods for enumerating permutation classes are introduced. The first is Struct, which is an algorithm that conjectures a structural description using rules similar to generalized grid classes. These conjectured structural descriptions ...
  • Khamespanah, Ehsan (2018-06)
    In the recent years, formal modeling and verification of realtime systems have become very important. Difficult-to-use modeling languages and inefficient analysis tools are the main obstacles to use formal methods in this domain. Timed actor model is ...
  • Lejsek, Herwig (2016-02)
    This thesis presents the NV-tree (Nearest Vector tree), which addresses thespecific problem of efficiently and effectively finding the approximatek-nearest neighbors within large collections of high-dimensional data points.The NV-tree is a very ...
  • Ali, Jafari (2016-06)
    This dissertation is composed of two parts. In the first part, performance evaluation and verification of safety properties are provided for real-time actors. Recently, the actor-based language, Timed Rebeca, was introduced to model distributed and ...
  • Jónsson, Kristján Valur (Háskólinn í Reykjavík, 2014-02-03)
    In-network aggregation is an important paradigm for current and future networked systems, enabling efficient cooperate processing of aggregate information, while providing sub-linear scalability properties. However, security of this important class of ...
  • Finnsson, Hilmar (Háskólinn í Reykjavík, 2012-06-25)
    The aim of General Game Playing (GGP) is to create intelligent agents that automatically learn how to play many different games at an expert level without any human intervention. One of the main challenges such agents face is to automatically learn ...