Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Kamilla Klonowska"'
Publikováno v:
Applied Sciences, Vol 14, Iss 3, p 1280 (2024)
Machine learning (ML) is increasingly used in diverse fields, including animal behavior research. However, its application to ambiguous data requires careful consideration to avoid uncritical interpretations. This paper extends prior research on ring
Externí odkaz:
https://doaj.org/article/eee215d755c24591af4b850ec572ab03
Autor:
Braco Veletanlic, Kamilla Klonowska
Akademisk slinga är ett pedagogiskt begrepp som används vid Högskolan Kristianstad. Akademisk slinga har för syfte att integrera generella kompetenser och färdigheter i ämneskurser i grundutbildningar. I sin grundform ska akademisk slinga även
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3b1b6a4863fd5fda4413676052b4744
http://urn.kb.se/resolve?urn=urn:nbn:se:hkr:diva-17554
http://urn.kb.se/resolve?urn=urn:nbn:se:hkr:diva-17554
Publikováno v:
Acta Informatica. 46:285-295
We consider the optimal makespan C(P, m, i) of an arbitrary set P of independent jobs scheduled with i preemptions on a multiprocessor with m identical processors. We compare the ratio for such makespans for i and j preemptions, respectively, where i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1efc316648ddc2b272f524038addec33
https://doi.org/10.1007/s00236-009-0096-5
https://doi.org/10.1007/s00236-009-0096-5
Publikováno v:
Acta Informatica. 41:341-365
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n computers are up and running, we would like the load to be evenly distributed among the computers. When one or more computers break down, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30162dd0bb3c64a94ca4ebf3b1aa3e6e
https://doi.org/10.1007/s00236-005-0161-7
https://doi.org/10.1007/s00236-005-0161-7
Publikováno v:
The Computer Journal. 47:527-544
Consider a parallel program with n processes and a synchronization granularity z. Consider also two parallel architectures: an SMP with q processors and run-time reallocation of processes to processors, and a distributed system (or cluster) with k pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45bd2038baf5e127669d6ead18ebe659
https://doi.org/10.1093/comjnl/47.5.527
https://doi.org/10.1093/comjnl/47.5.527
Publikováno v:
IPDPS
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all computers are up and running, we would like the load to be evenly distributed among the computers. When one or more computers break down the lo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39accf8a7e4dc7bc41e7f6f79e3cdb73
https://doi.org/10.1109/ipdps.2005.215
https://doi.org/10.1109/ipdps.2005.215
Publikováno v:
PRDC
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all computers are up and running, we would like the load to be evenly distributed among the computers. When one or more computers break down the lo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14e13659553f945841898386d5fef239
https://doi.org/10.1109/prdc.2004.1276564
https://doi.org/10.1109/prdc.2004.1276564
Publikováno v:
IPDPS
Clusters and distributed systems offer fault tolerance and high performance through load sharing, and are thus attractive in real-time applications. When all computers are up and running, we would like the load to be evenly distributed among the comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51af46e2959174e3b34e7ef34bce7b17
https://doi.org/10.1109/ipdps.2003.1213241
https://doi.org/10.1109/ipdps.2003.1213241
Publikováno v:
IPDPS
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all computers are up and running, we would like the load to be evenly distributed among the computers. When one or more computers break down the lo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95a3cba26fc45cf016316cc4903a5603
https://doi.org/10.1109/ipdps.2003.1213390
https://doi.org/10.1109/ipdps.2003.1213390
Publikováno v:
Advances in Computer Science-ASIAN 2004. Higher-Level Decision Making ISBN: 9783540240877
ASIAN
ASIAN
We give conditions for hash table probing which minimize the expected number of collisions. A probing algorithm is determined by a sequence of numbers denoting jumps for an item during multiple collisions. In linear probing, this sequence consists of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9da69a65e865417357a22dc06b8e1d6b
https://doi.org/10.1007/978-3-540-30502-6_11
https://doi.org/10.1007/978-3-540-30502-6_11