- Opin vísindi
- →
- Browsing by Subject
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Subject "Computer science"
Now showing items 1-13 of 13
-
(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 ... -
(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 ...
-
(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, ...
-
(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 ...
-
(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 ...
-
(Háskólinn í Reykjavík, 2014-03-09)Relational Agents (RAs) are virtual anthropomorphic characters able to engage in multimodal (i.e. using both verbal and nonverbal behavior) face-toface interactions with users in real-time. RAs are also capable of establishing and maintaining a long-term ...
-
(Háskólinn í Reykjavík, 2013-08-19)In the domain of intelligent systems, the management of mental resources is typically called “attention”. Attention exists because all moderately complex environments – and the real-world environments of everyday life in particular – are a source of ...
-
(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 ...
-
(2023-01)In this thesis, two methods for automatic enumeration of permutation classes are studied. The first method extends on the theory of combinatorial exploration. We review how combinatorial exploration works as a two phases process: the first phase ...
-
(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 ...
-
(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 ...
-
(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 ...
-
(2022-10-17)Concurrency as a phenomenon is observed in most of the current computer science trends. However the inherent complexity of analyzing the behavior of such a system is incremented due to the many different models of concurrency, the variety of applications ...
Now showing items 1-13 of 13