Search for dissertations about: "Function approximation"
Showing result 16 - 20 of 246 swedish dissertations containing the words Function approximation.
-
16. Few is Just Enough! : Small Model Theorem for Parameterized Verification and Shape Analysis
Abstract : This doctoral thesis considers the automatic verification of parameterized systems, i.e. systems with an arbitrary number of communicating components, such as mutual exclusion protocols, cache coherence protocols or heap manipulating programs. The components may be organized in various topologies such as words, multisets, rings, or trees. READ MORE
-
17. Road Surface and Tyre Interaction : Functional Properties affecting Road Dust Load Dynamics and Storage
Abstract : Luftburna partiklar (PM) är ett problem för människans hälsa, där flertalet samband mellan negativa hälsoeffekter finns mellan luftföroreningar finns, bland annat för respiratoriska sjukdomar, lungcancer och kardiovaskulära sjukdomar med flera. I länder där dubbdäck används, till exempel Sverige, Finland och Norge, och sandning av vägar och gator genomförs vintertid för att säkerställa god friktion kommer en betydande andel av partiklarna från vägslitage och nedkrossning av sand vilket bidrar till PM10. READ MORE
-
18. Vintage models of spatial structural change
Abstract : In the study a class of multisector network models, suitable for simulation of the interaction between production, demand, trade, and infrastructure, is presented. A characteristic feature of the class is a vintage model of the production system. READ MORE
-
19. Alternative Methods for Assessment of Split Renal Function
Abstract : Living kidney donation is a clinical situation with unique features in the sense that healthy individuals voluntarily expose themselves to certain risks and inconveniences. Therefore, eliminating as much of the associated discomfort as possible is crucial. READ MORE
-
20. Topics in Hardness of Approximation and Social Choice Theory
Abstract : Tools from Fourier analysis of Boolean functions have commonly been used to prove results both in hardness of approximation in computer science and in the study of voting schemes in social choice theory. In this thesis we consider various topics in both these contexts. READ MORE