SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "db:Swepub ;conttype:(scientificother);lar1:(mdh)"

Sökning: db:Swepub > Övrigt vetenskapligt/konstnärligt > Mälardalens universitet

  • Resultat 11-20 av 4741
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
11.
  •  
12.
  •  
13.
  • Abdi, Somayeh (författare)
  • Task Offloading in Edge-cloud Computing using a Q-Learning Algorithm
  • 2024
  • Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
    • Task offloading is a prominent problem in edge−cloud computing, as it aims to utilize the limited capacityof fog servers and cloud resources to satisfy the QoS requirements of tasks, such as meeting their deadlines.This paper formulates the task offloading problem as a nonlinear mathematical programming model to maximizethe number of independent IoT tasks that meet their deadlines and to minimize the deadline violationtime of tasks that cannot meet their deadlines. This paper proposes two Q-learning algorithms to solve theformulated problem. The performance of the proposed algorithms is experimentally evaluated with respect toseveral algorithms. The evaluation results demonstrate that the proposed Q-learning algorithms perform wellin meeting task deadlines and reducing the total deadline violation time.
  •  
14.
  •  
15.
  • Abelli, Björn (författare)
  • Directing and Enacting the Information System
  • 2007
  • Ingår i: Advances in Information Systems Development - New Methods and Practice for the Networked Society.. - Boston, MA : Springer US. - 9780387708010 ; , s. 13-23
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)
  •  
16.
  •  
17.
  •  
18.
  •  
19.
  • Abola, Benard (författare)
  • Perturbed Markov Chains with Damping Component and Information Networks
  • 2020
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • This thesis brings together three thematic topics, PageRank of evolving tree graphs, stopping criteria for ranks and perturbed Markov chains with damping component. The commonality in these topics is their focus on ranking problems in information networks. In the fields of science and engineering, information networks are interesting from both practical and theoretical perspectives. The fascinating property of networks is their applicability in analysing broad spectrum of problems and well established mathematical objects. One of the most common algorithms in networks' analysis is PageRank. It was developed for web pages’ ranking and now serves as a tool for identifying important vertices as well as studying characteristics of real-world systems in several areas of applications. Despite numerous successes of the algorithm in real life, the analysis of information networks is still challenging. Specifically, when the system experiences changes in vertices /edges or it is not strongly connected or when a damping stochastic matrix and a damping factor are added to an information matrix. For these reasons, extending existing or developing methods to understand such complex networks is necessary.Chapter 2 of this thesis focuses on information networks with no bidirectional interaction. They are commonly encountered in ecological systems, number theory and security systems. We consider certain specific changes in a network and describe how the corresponding information matrix can be updated as well as PageRank scores. Specifically, we consider the graph partitioned into levels of vertices and describe how PageRank is updated as the network evolves.In Chapter 3, we review different stopping criteria used in solving a linear system of equations and investigate each stopping criterion against some classical iterative methods. Also, we explore whether clustering algorithms may be used as stopping criteria.Chapter 4 focuses on perturbed Markov chains commonly used for the description of information networks. In such models, the transition matrix of an information Markov chain is usually regularised and approximated by a stochastic (Google type) matrix. Stationary distribution of the stochastic matrix is equivalent to PageRank, which is very important for ranking of vertices in information networks. Determining stationary probabilities and related characteristics of singularly perturbed Markov chains is complicated; leave alone the choice of regularisation parameter. We use the procedure of artificial regeneration for the perturbed Markov chain with the matrix of transition probabilities and coupling methods. We obtain ergodic theorems, in the form of asymptotic relations. We also derive explicit upper bounds for the rate of convergence in ergodic relations. Finally, we illustrate these results with numerical examples.
  •  
20.
  • Abrahamsson, Gun, 1977-, et al. (författare)
  • Ekonomiska ansvarsenheter
  • 2013. - 1
  • Ingår i: Perspektiv på ekonomistyrning. - Stockholm : Liber. - 9789147096947 ; , s. 14-35
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 11-20 av 4741
Typ av publikation
bokkapitel (1032)
konferensbidrag (762)
rapport (738)
doktorsavhandling (576)
tidskriftsartikel (486)
licentiatavhandling (386)
visa fler...
annan publikation (332)
bok (203)
samlingsverk (redaktörskap) (113)
recension (77)
proceedings (redaktörskap) (33)
forskningsöversikt (3)
konstnärligt arbete (2)
visa färre...
Typ av innehåll
övrigt vetenskapligt/konstnärligt  (4741)Ta bort avgränsningen
Författare/redaktör
Lundqvist, Kristina (53)
Biesta, Gert (51)
Wiklund Gustin, Lena ... (47)
Eriksson, Maria, 196 ... (47)
Söderbaum, Peter, 19 ... (46)
Nolte, Thomas (42)
visa fler...
Lönnermark, Anders, ... (41)
Björkman, Mats (36)
Yan, Jinyue (35)
Hansson, Hans (34)
Ingason, Haukur (34)
Bäck, Hanna (32)
Stier, Jonas, 1967- (32)
Crnkovic, Ivica (31)
Dodig-Crnkovic, Gord ... (31)
Pecorari, Diane, 196 ... (30)
Ekström, Mikael (29)
Sandberg, Anette (29)
Gallina, Barbara (28)
Thorin, Eva, 1967- (28)
Dahlquist, Erik (28)
Sjödin, Mikael (27)
Gherardi, Silvia (27)
Hallin, Anette (27)
Malyarenko, Anatoliy ... (25)
Dodig-Crnkovic, Gord ... (25)
Pettersson, Paul (24)
Wamala, Sarah (24)
Yan, Jinyue, 1959- (24)
Seceleanu, Cristina (23)
Silvestrov, Sergei, ... (23)
Dahlquist, Erik, 195 ... (23)
Bohlin, Markus (23)
Lahdenperä, Pirjo, 1 ... (23)
Färnlöf, Hans, 1970- (23)
Carlson, Jan (22)
Tillgren, Per, 1945- (22)
Månsson, Niclas, 196 ... (22)
Regnö, Klara, 1973- (22)
Kautiainen, Susanna (21)
Darvishpour, Mehrdad ... (21)
Segelod, Esbjörn (21)
Papahristodoulou, Ch ... (21)
Eriksson, Yvonne (20)
Hallin, Anette, 1969 ... (20)
Lindén, Maria (19)
Mubeen, Saad (19)
Dobers, Peter, 1966 (19)
Sandberg, Håkan, 195 ... (19)
Mäki-Turja, Jukka (19)
visa färre...
Lärosäte
Mälardalens universitet  (4741)Ta bort avgränsningen
Uppsala universitet (242)
Högskolan Dalarna (148)
Örebro universitet (126)
Kungliga Tekniska Högskolan (91)
Stockholms universitet (85)
visa fler...
Linnéuniversitetet (79)
RISE (67)
Karolinska Institutet (60)
Marie Cederschiöld högskola (58)
Linköpings universitet (46)
Södertörns högskola (45)
Göteborgs universitet (43)
Chalmers tekniska högskola (35)
Karlstads universitet (35)
Jönköping University (31)
Högskolan i Gävle (24)
Luleå tekniska universitet (23)
Umeå universitet (20)
Röda Korsets Högskola (18)
Lunds universitet (16)
Mittuniversitetet (14)
Högskolan i Skövde (8)
Sophiahemmet Högskola (8)
Högskolan i Halmstad (7)
Handelshögskolan i Stockholm (7)
Högskolan i Borås (6)
Blekinge Tekniska Högskola (6)
Malmö universitet (4)
Institutet för språk och folkminnen (4)
Högskolan Väst (3)
Konstfack (2)
Sveriges Lantbruksuniversitet (2)
Högskolan Kristianstad (1)
Riksantikvarieämbetet (1)
VTI - Statens väg- och transportforskningsinstitut (1)
visa färre...
Språk
Engelska (3286)
Svenska (1364)
Franska (23)
Norska (19)
Tyska (11)
Italienska (10)
visa fler...
Finska (8)
Spanska (4)
Kurdiska (4)
Danska (3)
Portugisiska (2)
Japanska (2)
Ryska (1)
Polska (1)
Nederländska (1)
Turkiska (1)
Koreanska (1)
visa färre...
Forskningsämne (UKÄ/SCB)
Samhällsvetenskap (1579)
Teknik (975)
Naturvetenskap (611)
Medicin och hälsovetenskap (533)
Humaniora (275)
Lantbruksvetenskap (11)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy