Relevant bibliographies by topics / Algoritmen

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Algoritmen'

Author: Grafiati
Published: 4 June 2021
Last updated: 27 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algoritmen.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Algoritmen"

1

Eidstuen, Jon Sigurd, and Hege Kornør. "Diagnostisk nøyaktighet ved algoritmen til den norske versjonen av StrengthsandDifficulties Questionnaire (SDQ)." PsykTestBarn 7, no. 1 (2017): 1–14. http://dx.doi.org/10.21337/0049.

Full text
Abstract:
Beskrivelse: Strengths and Difficulties Questionnaire (SDQ) er et sett spørreskjema med tre informantversjoner: foreldre, lærere og barn ≥ 11 år. Måleegenskapene ved de ulike informantversjonene av SDQ er vurdert i separate PsykTestBarn-artikler. Robert Goodman har utviklet en algoritme for å predikere hvorvidt en psykisk lidelse er tilstede. SDQ-algoritmen inneholder data fra minst to informanter, men kan også ha data fra samtlige tre informanter. Ved hjelp av algoritmen kan man estimere sannsynligheten for at et barn har en diagnose blant fire brede kategorier: emosjonell lidelse, atferdsforstyrrelse, hyperkinetisk-/oppmerksomhetsforstyrrelse og noen (minst én) psykisk lidelse. Sannsynligheten har tre terskelverdier: unlikely, possible og probable. I denne artikkelen undersøker vi den diagnostiske nøyaktigheten til SDQ-algoritmen i skandinaviske utvalg. Litteratursøk: Av 541 unike treff vurderte vi 133 i fulltekst, hvorav 11 publikasjoner oppfylte inklusjonskriteriene. Fem publikasjoner var delstudier i kohortstudien Barn i Bergen, fem var andre norske studier og én var en dansk studie. Studiene omfattet både befolknings- og selekterte utvalg i alderen 5-18 år. Psykometri: Seks studier rapporterte relevante data for vurdering av diagnostisk nøyaktighet, mens fem kun rapporterte forekomster. SDQ-algoritmen hadde generelt god sensitivitet, spesifisitet og negativ prediktiv verdi i selekterte utvalg, mens den positive prediktive verdien varierte. I befolkningsutvalg der kun ADHD var undersøkt hadde algoritmen utmerket spesifisitet og negativ prediktiv verdi, mens sensitiviteten og den positive prediktive verdien var utilfredsstillende for denne diagnosen. Ingen av referansestandardene i studiene av diagnostisk nøyaktighet hadde godt nok dokumentert kriterievaliditet. Konklusjon: Med forbehold om usikkerheten knyttet til referansestandarden og normgrunnlag i de inkluderte studiene, har SDQ-algoritmen god evne til å identifisere barn med og uten noen psykisk lidelse i selekterte utvalg. I befolkningsbaserte utvalg kan SDQ-algoritmen med stor sannsynlighet korrekt utelukke ADHD, mens den har dårlig evne til å påvise ADHD. For å få bedre kunnskap om SDQ-algoritmens diagnostiske nøyaktighet i norske utvalg trenger vi studier som bruker en referansestandard med dokumentert kriterievaliditet.
APA, Harvard, Vancouver, ISO, and other styles
2

Van Dalen, Arjen. "Når algoritmer styrer nyhedsstrømmen. YouTube-anbefalinger under folketingsvalget i 2019." Politica 53, no. 2 (2021): 168–87. http://dx.doi.org/10.7146/politica.v53i2.130385.

Full text
Abstract:
Hvad folk ser og læser i medierne, bestemmes ikke længere kun af journalister, men i stigende grad af algoritmer. Disse algoritmer vælger, sorterer og prioriterer vores information. Automatiserede processer, som fx YouTubes anbefalingsalgoritme, påvirker den måde, vi ser verden på. Et vigtigt demokratisk spørgsmål er derfor, om YouTubes anbefalingsalgoritme eksponerer publikum incidentalt for politisk information, efter at man har set underholdningsindhold, og om algoritmen skaber en filterboble ved primært at anbefale indhold med et lignende politisk perspektiv. Under det danske folketingsvalg i 2019 var anbefalingsalgoritmen mere tilbøjelig til at føre seere væk fra end hen imod nyheder med politisk indhold. Når folk havde set en video, der var uploadet af de politiske partier Venstre eller Stram Kurs, blev de af algoritmen primært anbefalet videoer fra de samme partier, hvilket kan medføre, at de bliver bekræftede i forudindtagne holdninger (bekræftelsesbias). For andre partier var dette mindre tilfældet. Kun i begrænset omfang fører anbefalingsalgoritmen seere fra mainstream til ekstremt højreorienteret indhold.
APA, Harvard, Vancouver, ISO, and other styles
3

van Elst, Laura. "Algoritmen preciseren bestraling." Zorgvisie tech 23, no. 3 (2022): 28–29. http://dx.doi.org/10.1007/s41186-022-0715-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gstrein, Oskar J., and Andrej Zwitter. "Een transparant debat over algoritmen." Bestuurskunde 29, no. 4 (2020): 30–42. http://dx.doi.org/10.5553/bk/092733872020029004004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

 . "721 Toetsing Aangepaste ZZP’S En Algoritmen." Zorg en Financiering 7, no. 6 (2008): 38–39. http://dx.doi.org/10.1007/bf03096957.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

van der Voort, Haiko, and Joanna Strycharz. "Transparantie van algoritmen: naar een empirische onderzoeksagenda." Bestuurskunde 29, no. 4 (2020): 3–6. http://dx.doi.org/10.5553/bk/092733872020029004001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hu, Michel, Kim Rijkers, Jim Dings, et al. "Netwerkactiviteit in een gekweekt hersenbiopt." Epilepsie, periodiek voor professionals 19, no. 4 (2021): 14–16. http://dx.doi.org/10.54160/epilepsie.11399.

Full text
Abstract:
Analyse van grote hoeveelheden data om daarmee verbanden te kunnen leggen, bijvoorbeeld verbanden binnen een netwerk van neuronen, is door recente technische ontwikkelingen (snellere computers, ontwikkeling van algoritmen, etc.) toegankelijker geworden voor onderzoekers. Onderstaande beschrijft een systeem voor de acquisitie en analyse van netwerkactiviteit in een gekweekt hersenbiopt.
APA, Harvard, Vancouver, ISO, and other styles
8

Drouen, Thijs, and Marlies Eck. "Toezicht op het gebruik van algoritmen door de overheid." Tijdschrift voor Toezicht 11, no. 1 (2020): 32–35. http://dx.doi.org/10.5553/tvt/187987052020011001005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cools, Hannes. "Hoe algoritmen een extra laag toevoegen aan de journalistiek." Tijdschrift voor Communicatiewetenschap 52, no. 1 (2024): 83–105. http://dx.doi.org/10.5117/tcw2024.1.005.cool.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cools, Hannes. "Hoe algoritmen een extra laag toevoegen aan de journalistiek." Tijdschrift voor Communicatiewetenschap 52, no. 1 (2024): 83–105. http://dx.doi.org/10.5117/tcw2023.x.004.cool.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Algoritmen"

1

Lundell, David. "Detektion av vätgasläckor med CUSUM-algoritmen." Thesis, Linköping University, Department of Electrical Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-18634.

Full text
Abstract:
<p>Detektion av gasläckor används i en mängd olika applikationer som till exempel kvalitetskontroll av kylskåp, lokalisering av skador på kablar och lokalisering av bränsleläckor i bränsletankar.</p><p>Denna rapport undersöker förbättring av detektionsalgoritmen i en existerande vätgasdetektor.</p><p>CUSUM algoritmen är en enkel men kraftfull metod för att snabbt detektera små ändringar i nivån av en signal. Denna metod är anpassad till det dynamiska beteendet i sensorn som används för att spåra vätgasläckorna och även utvärderad på omfattande mätningar utförda på läckor med kända storlekar. Resultaten visar att användning av den föreslagna detektionsalgoritmen innebär en betydande ökning av detektorns prestanda. Särskilt bra blir resultatet på små läckor.</p>
APA, Harvard, Vancouver, ISO, and other styles
2

Andersson, Patrik. "Voxelbaserad rendering med "Marching Cubes"-algoritmen." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-6096.

Full text
Abstract:
Det finns flera olika metoder och tekniker för tredimensionell rendering, alla med olika för- och nackdelar som lämpar sig för olika applikationer. Voxelbaserad rendering har använts flitigt inom vetenskapliga områden, främst inom det medicinska för visualisering av volymetrisk data. Tekniken används nu inom flera olika områden för tredimensionell rendering, t.ex. i datorspel, i matematiska applikationer och vid geologisk rekonstruktion. I den här rapporten kommer voxelbaserad rendering med Marching Cubes-algoritmen undersökas för att se hur den lämpar sig för realtidsapplikationer. Området behandlas dels teoretiskt, men även praktiskt då en implementering av Marching Cubes gjordes för att genomföra några tester för att se hur prestandan påverkades. Av testerna framkom det tydligt att algoritmen lämpar sig väl för realtidsapplikationer och dagens grafikkort. Viss optimering krävs dock för att kunna utnyttjas på bästa sätt.<br>There are lots of different methods and techniques for three-dimensional rendering, everyone with different advantages and disadvantages that suits different applications. Voxel-based rendering has been used frequently within the scientific area, mainly within medicin for visualization of volumetric data. The technique is now used within many different areas for three-dimensional rendering, e.g. in computer games, in mathematical applications and in geological reconstruction. In this report voxel-based rendering with Marching Cubes algorithm will be researched to see how it suits for real-time applications. The area will partly be dealt with theoretically, but also practically as an implementation of Marching Cubes was done to run some tests to see how the performance was affected. From the tests it appeared cleary that the algorithm is well suited for real-time applications and today&apos;s graphics card. Though some optimization is needed to fully take advantage of it.
APA, Harvard, Vancouver, ISO, and other styles
3

Arvidsson, Klas. "Simulering av miljoner grindar med Count Algoritmen." Thesis, Linköping University, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2476.

Full text
Abstract:
<p>A key part in the development and verification of digital systems is simulation. But hardware simulators are expensive, and software simulation is not fast enough for designs with a large number of gates. As today’s digital zesigns constantly grow in size (number of gates), and that trend shows no signs to end, faster simulators handling millions of gates are needed. </p><p>We investigate how to create a software gate-level simulator able to simulate a high number of gates fast. This involves a trade-off between memory requirement and speed. A compact netlist representation can utilize cache memories more efficient but requires more work to interpret, while high memory requirements can limit the performance to the speed of main memory. </p><p>We have selected the Counting Algorithm to implement the experimental simulator MICA. The main reasons for this choice is the compact way in which gates can be stored, but still be evaluated in a simple and standard way. </p><p>The report describes the issues and solutions encountered and evaluate the resulting simulator. MICA simulates a SPARC architecture processor called Leon. Larger netlists are achieved by simulating several instances of this processor. Simulation of 128 instances is done at a speed of 9 million gates per second using only 3.5MB memory. In MICA this design correspond to 2.5 million gates.</p>
APA, Harvard, Vancouver, ISO, and other styles
4

Hedlund, Joakim, and Niklas Qvarforth. "Optimal Yatzy : Kan den optimala algoritmen optimeras?" Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166764.

Full text
Abstract:
Yahtzee is a game based on luck. Yet there are algorithms designed to give an optimal result and succeeds in doing so. This report compares the end result of an optimal algorithm to an algorithm that has been modified for the multiplayer scenario. The modified algorithm tries to win over the optimal algorithm through taking greater risks in its decisions when falling behind in points. The results show that it is not favorable to do so. For the chance taking to be favorable one has to be sure that a loss is certain with the current strategy.
APA, Harvard, Vancouver, ISO, and other styles
5

Olofsson, Jim. "Prestandaförändringar vid estetiska förbättringar av A*algoritmen." Thesis, Högskolan i Skövde, Institutionen för kommunikation och information, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-6356.

Full text
Abstract:
Algoritmer för vägplanering används ofta i dataspel för att navigera datorstyrda enheter. En av de vanligaste algoritmerna som används i samband med vägplanering är A* algoritmen, som kan användas för att effektivt hitta den kortaste vägen mellan två positioner i spelets nivåer. Algoritmen har dock inget stöd för att producera estetiskt tilltalande vägar, vilket kan leda till att spelets enheter rör sig som robotar genom spelnivån. Detta arbete tar upp och analyserar algoritmer som kan användas i kombination med A* algoritmen för att göra vägarna rakare, mjukare och mer direkta. Algoritmerna implementeras i ett program där deras minnesanvändning, tidseffektivitet och väglängd beräknas när de körs genom en spelnivå med väggar och hinder. Resultaten från slutet av rapporten visar att de estetiskt förbättrande algoritmerna kan implementeras för att göra stora förbättringar av A* algoritmens estetiska prestationer, utan större påverkningar på A* algoritmens minnesanvändning, tidseffektivitet och väglängd. Resultaten från både produkt och utvärderingen skulle kunna användas i framtida spelprojekt.
APA, Harvard, Vancouver, ISO, and other styles
6

Bartfai, Sara. "Algoritmen som kulturellt redskap : Fyra elevers förståelse av additionsalgoritmen." Thesis, Södertörns högskola, Lärarutbildningen, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-30927.

Full text
Abstract:
The aim of this investigation has been to examine four students, in a second grade class in Stockholm, understanding of the addition algorithm. A small field study has been carried out including both interviews and classroom studies. Vygotsky’s socio-cultural theory and more specifically the concepts of mediation and cultural tools have been applied. Vygotsky asserts that our contact with the world is mediated by cultural tools. The addition algorithm is in this thesis seen as a cultural tool that the students are to appropriate. The results show a variation of the student’s understanding of the addition algorithm. Most importantly it shows that it is possible for students to “say more than they know” with the use of the algorithm. It is difficult to see how much a student really understand of a mathematical concept and easier to see if they do not understand it or are using it in an inappropriate way. Therefore it is necessary for teachers to form a dialogue with the students and ask them why they do as they do while using different mathematical concepts, such as addition algorithms, to acquire a perception of their mathematical understanding.
APA, Harvard, Vancouver, ISO, and other styles
7

Hendriks, Peter Anne. "Algebraic aspects of linear differential and difference equations." [S.l. : [Groningen] : s.n.] ; [University Library Groningen] [Host], 1996. http://irs.ub.rug.nl/ppn/153769580.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kovaleva, Sofia. "Approximation of geometric set packing and hitting set problems." [Maastricht : Maastricht : Universiteit Maastricht] ; University Library, Maastricht University [Host], 2003. http://arno.unimaas.nl/show.cgi?fid=7461.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Alstermark, Annica, and SANDRA GROSZ. "Läsbarhetsalgoritmer : En utvärdering av möjligheten att bygga ut LIX-algoritmen." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157675.

Full text
Abstract:
Läsbarhet handlar om hur begriplig en text är och är ett område som har studerats under väldigt många år. I denna studie utvärderas möjligheten att bygga ut den existerande läsbarhetsalgoritmen LIX med syftet att konstruera en algoritm som gör en mer exakt bedömning. I studien utvecklas en algoritm baserat på LIX och tidigare forskning inom läsbarhet, även sambandet mellan läsbarhetsnivå och ordklassfördelning undersöks. Under studien visade det sig att det finns ett samband mellan en texts läsbarhetsnivå och andelen verb och substantiv. Algoritmen byggdes ut med två parametrar; andelen vanliga ord samt skillnaden mellan andelen verb och substantiv. Resultatet visade att den nya algoritmen ger ett åtminstone lika bra resultat som LIX-algoritmen. Det var dock inte möjligt att dra några slutsatser om dess exakthet i jämförelse med LIX-algoritmen då resultatet av testerna som involverade mänsklig bedömning var undermåligt. Vidare diskuteras då hurman kan få pålitliga resultat från läsbarhetstester som baseras på mänsklig bedömning.<br>Readability is about how comprehensible a text is and it is a field which has been studied for many years. In this study the possibility of expanding the readability algorithm LIX, with the purpose of constructing an algorithmwhich is more exact, is evaluated. In the study an algorithm is developed based on LIX and earlier research within readability. The relation between readability level and the parts of speech distribution is also evaluated. During the study it was shown that there is a relation between the readability of a text and the proportion of verb and noun. The algorithm was expanded with two parameters; the number of common words and the difference between the proportion of verbs and nouns. The result showed that the new algorithm gave a result that was at least equally good to that of LIX. It was not possible to draw any conclusion to the new algorithm’s accuracy in comparison to LIX due to the substandard quality of the test involving human evaluation. Further it is discussed how more reliable results can beobtained from readability tests based on human evaluation.
APA, Harvard, Vancouver, ISO, and other styles
10

Spieksma, Frederik Cornelis Rafaël. "Assignment and scheduling algorithms in automated manufacturing." [Maastricht : Maastricht : Rijksuniversiteit Limburg] ; University Library, Maastricht University [Host], 1992. http://arno.unimaas.nl/show.cgi?fid=5684.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Algoritmen"

1

ESA '97 (1999 Prague, Czech Republic). Algorithms - ESA '99: 7th annual European symposium, Prague, Czech Republic, July 1999 : proceedings. Springer, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

The advent of the algorithm: The 300 year journey from an idea to the computer. Harcourt, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Berlinski, David. The advent of the algorithm: The idea that rules the world. Harcourt, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Workshop, WADS '89 (1989 Ottawa Ont ). Algorithms and data structures: Workshop WADS '89, Ottawa, Canada, August 17-19, 1989 : proceedings. Springer-Verlag, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Searching with probabilities. Pitman Advanced Pub. Program, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

E, Rawlins Gregory J., ed. Foundations of genetic algorithms. M. Kaufmann Publishers, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Scandinavian Workshop on Algorithm Theory (7th 2000 Bergen, Norway). Algorithm theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 5-7, 2000 ; proceedings. Springer, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Scandinavian Workshop on Algorithm Theory (7th 2000 Bergen, Norway). Algorithm theory-- SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000 : proceedings. Springer, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

NATO Advanced Study Institute on Fundamental Algorithms for Computer Graphics (1985 Ilkley, West Yorkshire). Fundamental algorithms for computer graphics. Springer-Verlag, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

1944-, Earnshaw Rae A., Cambridge Interactive Systems Ltd. (Great Britain), and North Atlantic Treaty Organization. Scientific Affairs Division., eds. Fundamental algorithms for computer graphics. Springer-Verlag, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Algoritmen"

1

Heise, Nele. "Algorithmen." In Handbuch Medien- und Informationsethik. J.B. Metzler, 2016. http://dx.doi.org/10.1007/978-3-476-05394-7_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Borgwardt, Karl Heinz. "Algorithmen." In Optimierung Operations Research Spieltheorie. Birkhäuser Basel, 2001. http://dx.doi.org/10.1007/978-3-0348-8252-1_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gansterer, Wilfried, and Christoph Überhuber. "Algorithmen." In Hochleistungsrechnen mit HPF. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59503-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pöpsel, Josef, Ute Claussen, Rolf-Dieter Klein, and Jürgen Plate. "Algorithmen." In Computergrafik. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-46799-8_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Solymosi, Andreas, and Ilse Schmiedecke. "Algorithmen." In Programmieren mit JAVA. Vieweg+Teubner Verlag, 1999. http://dx.doi.org/10.1007/978-3-322-96870-8_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Blieberger, Johann, Bernd Burgstaller, and Gerhard-Helge Schildt. "Algorithmen." In Springers Lehrbücher der Informatik. Springer Vienna, 2002. http://dx.doi.org/10.1007/978-3-7091-3774-1_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Schildt, Gerhard H. "Algorithmen." In Springers Lehrbücher der Informatik. Springer Vienna, 2000. http://dx.doi.org/10.1007/978-3-7091-3775-8_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Schildt, Gerhard H. "Algorithmen." In Springers Lehrbücher der Informatik. Springer Vienna, 2000. http://dx.doi.org/10.1007/978-3-7091-3775-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Blieberger, Johann, Johann Klasek, Alexander Redlein, and Gerhard-Helge Schildt. "Algorithmen." In Springers Lehrbücher der Informatik. Springer Vienna, 1996. http://dx.doi.org/10.1007/978-3-7091-4051-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Blieberger, Johann, Gerhard-Helge Schildt, Ulrich Schmid, and Stefan Stöckler. "Algorithmen." In Springers Lehrbücher der Informatik. Springer Vienna, 1992. http://dx.doi.org/10.1007/978-3-7091-4052-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algoritmen"

1

Cicėnas, Vilius. "AUTONOMINĖS AGENTO ELGSENOS MODELIAVIMAS REALISTIŠKAME MINIOS SIMULIAVIMO PROCESE." In Inžinerinė grafika ir projektavimas. Informacinių technologijų sauga ir informacinės sistemos. VGTU Technika, 2016. http://dx.doi.org/10.3846/itsis.2016.04.

Full text
Abstract:
Siekiant sukurti tikrovišką minios simuliavimo modelį svarbu sujungti ir derinti įvairias metodikas, kad būtų išgautas unikalus norimas rezultatas, nes universalus algoritmas dar neegzistuoja. Tikroviškumo palaikymas yra dažnai ribojamas kompiuterinių resursų, taigi, renkantis algoritmus ir metodikas, reikia skirti nemažai pastangų planuojant, ištiriant ir ištestuojant galimus simuliavimo būdus. Todėl vis dar yra poreikis modeliui, kurio elgsena būtų lengvai pritaikoma prie simuliacijos poreikių. Straipsnyje glaustai aptarti svarbiausi parametrai, aplinkybės, populiariausios metodikos ir algoritmai, pateiktas algoritmo šablonas autonominiam ir realistiškam agento elgsenos modeliavimui simuliuojamoje aplinkoje.
APA, Harvard, Vancouver, ISO, and other styles
2

Maknickienė, Nijolė, and Kristina Miškinytė. "SKAITMENINIŲ VALIUTŲ KAINŲ PROGNOZAVIMAS NAUDOJANT GILIOJO MOKYMOSI ALGORITMĄ." In 23rd Conference for Young Researchers "Economics and Management". Vilnius Gediminas Technical University, 2020. http://dx.doi.org/10.3846/vvf.2020.033.

Full text
Abstract:
Kriptovaliutos vis dar yra finansų rinkos naujovė ir iki galo neištirta finansinis instrumentas. Tai išlaiko kriptovaliutas įdomia ir aktualia tema, tiek mokslininkams, tiek reguliacinėms institucijoms bei investuotojams. Kriptovaliutų rinka yra auganti, nestabili ir nuolat besikeičianti, kas suteikia jai aukštą riziką ir plačias galimybes. Finansinis išmanymas ir toliaregiškas prognozavimas, nepasimetant pinigų vertės, rizikos ir nenuspėjamumo chaose yra ypač svarbus šiandieninėje ekonomikoje. Sudėtingas kriptovaliutų rinkos pobūdis reikalauja plataus profilio duomenų kiekio, kuriam apdoroti taikomi įvairūs metodai, tokie kaip statistinė, techninė, sentimentų, sprendimų bei kita analizė. Ankstesni tyrimai kriptovaliutų kainas numatė dviem būdais: empirine analize ir mašinų mokymosi algoritmų analize. Šiame straipsnyje testuojamas giliojo mokymosi algoritmo taikymo galimybės kriptovaliutų kainų prognozavime. Taikant ilgalaikės trumpalaikės atminties tinklo (angl. long, short-term network, toliau LSTM) algoritmą, prognozuojamas trumpalaikis kriptovaliutų kainų kitimas bei įvertinamas sugeneruotų duomenų tikslumas. Rezultatai parodė, kad giliojo mokymosi algoritmas kainas prognozuoja su maža paklaida ir tiksliai nuspėję kainos pokyčio tendenciją, kas leidžia teigti, kad giliojo mokymosi algoritmas yra efektyvi rizikos mažinimo priemonė finansų rinkoje.
APA, Harvard, Vancouver, ISO, and other styles
3

Tabernik, Domen, Peter Mlakar, Jakob Božič, Luka Čehovin Zajc, Vid Rijavec, and Danijel Skočaj. "Demonstracijska celica za prikaz globokega učenja v praktičnih aplikacijah." In Strokovna konferenca ROSUS 2024: Računalniška obdelava slik in njena uporaba v Sloveniji 2024. Univerza v Mariboru, Univerzitetna založba, 2024. http://dx.doi.org/10.18690/um.feri.1.2024.2.

Full text
Abstract:
V zadnjih letih so metode globokega učenja postale ključno orodje za reševanje raznolikih praktičnih izzivov. Kljub temu pa potencial takih metod pogosto ostaja slabo razumljiv širši javnosti zaradi pogostega ločevanja razvoja in demonstracije algoritmov od dejanskih praktičnih problemov, ki jih algoritmi naslavljajo. V tem članku predstavljamo demonstracijsko celico, ki združuje strojno in programsko opremo ter algoritme globokega učenja, omogočajoč enostavno prikazovanje delovanja teh metod v različnih aplikativnih domenah. Celica vključuje kamere, grafični vmesnik in pet demonstracijskih programov, ki demonstrirajo klasifikacijo lesenih desk, detekcijo površinskih anomalij, štetje polipov, detekcijo prometnih znakov in detekcijo vogalov tekstilnih izdelkov. Implementiran modularni pristop omogoča enostavno integracijo različnih algoritmov globokega učenja. Sistem omogoča boljše razumevanje in uporabo teh metod v praktičnih scenarijih ter prispeva k razvoju inovativnih rešitev na področju globokega učenja.
APA, Harvard, Vancouver, ISO, and other styles
4

Bissoli, Marçal Luiz, Kalinka R. L. J. Castelo Branco, and Edward David Moreno. "Algoritmos de Multiplicação de Montgomery em Hardware e Impacto no Algoritmo RSA." In Workshop em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2007. http://dx.doi.org/10.5753/wscad.2007.18760.

Full text
Abstract:
Neste artigo descreve-se o método de Montgomery para multiplicação modular, bem como são examinados dois dos seus algoritmos, a saber: O Algoritmo Rápido de Montgomery (Fast Montgomery Algorithm) e o Algoritmo Mais Rápido de Montgomery (Faster Montgomery algorithm). São ainda apresentadas dois diagramas de máquinas de Estados correspondentes à descrição em VHDL desses algoritmos e a respectiva implementação em FPGAs. No final são apresentadas comparações entre os desempenhos dos algoritmos Rápido e Mais Rápido de Montgomery, focando seu impacto no algoritmo RSA para diferentes tamanhos de chaves.
APA, Harvard, Vancouver, ISO, and other styles
5

Xavier, Felipe, Edson Tavares Camargo, and Elias Duarte Jr. "Uma Implementação MPI Tolerante a Falhas do Algoritmo Paralelo de Ordenação Quickmerge." In XX Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2019. http://dx.doi.org/10.5753/wscad.2019.8675.

Full text
Abstract:
O algoritmo de ordenação paralelo Quickmerge combina a estratégia do algoritmo Quicksort com operações de fusão de subconjuntos criados a partir de elementos chaves, chamados pivôs. Duas versões do algoritmo Quickmerge que executam sobre o hipercubo foram encontradas na literatura, porém nenhuma considera falhas de processos. Este trabalho apresenta uma implementação MPI tolerante a falhas dos algoritmos Quickmerge e Quickmerge Modificado na topologia virtual denominada VCube. Os algoritmos propostos são capazes de executar a ordenação mesmo que todos menos um processo falhem. Os algoritmos são comparados a uma implementação tolerante a falhas do algoritmo paralelo Hyperquicksort. Resultados mostram a eficiência da implementação na ordenação de até 1 bilhão de números inteiros em cenários com e sem falhas.
APA, Harvard, Vancouver, ISO, and other styles
6

Cordeiro, Michel B., and Wagner M. Nunan Zola. "KNN paralelo em GPU para grandes volumes de dados com agregação de consultas." In Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2023. http://dx.doi.org/10.5753/wscad.2023.235966.

Full text
Abstract:
Algoritmos de aprendizado de máquina geralmente apresentam um alto custo computacional. Várias abordagens podem ser empregadas para acelerar esses algoritmos. Uma das estratégias envolve a utilização de unidades de processamento gráfico (GPU). Nesse cenário, este artigo apresenta uma implementação eficiente para processamento do algoritmo exato para consultas K-Nearest Neighbor (KNN) em GPU. O algoritmo proposto foi comparado com algoritmos disponíveis na biblioteca FAISS amplamente utilizada para busca de similaridade baseada em GPU. Experimentos demonstraram que nosso novo algoritmo para KNN exato supera o FAISS para grandes conjuntos de dados quando há apenas um ponto no conjunto de pesquisa. O novo kernel também apresenta melhores resultados com a agregação de consultas, sendo uma boa alternativa para uso em aplicações que podem realizar consultas paralelas em pequenos lotes, onde obteve aceleração de até 4.76 vezes em relação ao algoritmo exato da biblioteca FAISS, até 10.46 vezes em relação ao algoritmo aproximado.
APA, Harvard, Vancouver, ISO, and other styles
7

Silva, Rheidner, and André Britto. "NSGA-III com Adaptação dos Pontos de Referência." In Encontro Nacional de Inteligência Artificial e Computacional. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/eniac.2019.9312.

Full text
Abstract:
Algoritmos Evolucionários Multi-objetivo enfrentam dificuldades na resolução de problemas com mais de 3 objetivos, os chamados Problemas de Otimização com Muitos Objetivos. Novos algoritmos então surgiram para contornar este problema, entre eles NSGA-III, que explora o conceito de pontos de referência para realizar a seleção de soluções. Porém, certas limitações ainda são apresentadas pelo algoritmo que pode ser melhorado. Assim, este trabalho propõe dois processos de adaptação dos pontos de referência no algoritmo NSGA-III, baseado no algoritmo MOEA/D-AWA. Os algoritmos com os dois processos propostos foram avaliados, buscando verificar se o processo de adaptação proposto melhora o desempenho do NSGA-III.
APA, Harvard, Vancouver, ISO, and other styles
8

Cepak, Nastja, and Jakob Matek. "Hibridni certifikati post-kvantne kriptografije." In OTS 2023 Sodobne informacijske tehnologije in storitve. Univerza v Mariboru, Univerzitetna založba, 2023. http://dx.doi.org/10.18690/um.feri.8.2023.3.

Full text
Abstract:
Kvantni računalniki obetajo omogočiti izračune, ki jim niso kos niti današnji najmočnejši super računalniki. Razvoj kvantnih računalnikov in algoritmov pa bo tudi dosegel razvojno stopnjo, ko obstoječi varnostni mehanizmi ne bodo več nudili zaščite podatkov in digitalnega zaupanja. Pričakujemo, da se bomo v obdobju tranzicije s tradicionalnih asimetričnih kriptografskih algoritmov (RSA in ECC) na post-kvantne algoritme posluževali tako imenovanih »hibridnih rešitev«, torej rešitev, ki hkrati podpirajo klasično in post-kvantno kriptografijo. V prispevku se bomo osredotočili na hibridne digitalne certifikate in bomo prikazali, kako lahko integriramo post-kvantne algoritme v x509 format digitalnih certifikatov.
APA, Harvard, Vancouver, ISO, and other styles
9

Laurindo, Luís Eduardo Costa, and Francisco José da Silva e Silva. "SaturBFS: Um Algoritmo de Coloração de Grafos para Resolução do Sudoku." In Escola Regional de Computação Ceará, Maranhão, Piauí. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/ercemapi.2021.17910.

Full text
Abstract:
Este estudo propõe um algoritmo de coloração de grafos intitulado Saturated Breadth-First Search (SaturBFS) para determinar soluções válidas do Sudoku. Concebeu-se o algoritmo por meio da combinação dos algoritmos de Busca em Largura (BFS) e DSatur. O objetivo é realizar uma análise comparativa do SaturBFS com os algoritmos BFS não saturado e Busca em Profundidade (DFS) para diferentes níveis (fácil, médio e difícil) e instâncias do Sudoku (4x4, 6x6, 8x8, 9x9, 10x10 e 12x12). Para a avaliação, considerou-se o tempo que os algoritmos levam para determinar uma solução válida e as porcentagens de soluções válidas encontradas. O algoritmo SaturBFS apresentou maior porcentagem de soluções válidas encontradas em um menor tempo.
APA, Harvard, Vancouver, ISO, and other styles
10

Chiaramonte, Rodolfo B., Edward D. M. Ordonez, Fábio D. Pereira, and Kalinka R. L. J. C. Branco. "Aspectos de Desempenho do SICO-Sistema de Comunicação de Dados com Suporte Dinâmico a Segurança." In Workshop em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2006. http://dx.doi.org/10.5753/wscad.2006.18952.

Full text
Abstract:
Atualmente existe uma grande quantidade de algoritmos criptográficos, o que dificulta muito definir qual será o melhor algoritmo a ser utilizado em uma determinada conexão. Com isto, o objetivo do projeto foi a implementação um sistema capaz de definir através de alguns parâmetros coletados do ambiente em que estiver sendo executado qual é o algoritmo ou conjunto de algoritmos mais indicado para uma determinada conexão segura. lnicialmente foram implementados diversos algoritmos de criptografia, e posteriormente, o sistema para o controle da comunicação bem como um protocolo que permita alterar dinamicamente as chaves e os algoritmos. A implementação do sistema, chamado de SICO - Sistema Inteligente de Comunicação - foi desenvolvida utilizando a linguagem Java.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Algoritmen"

1

Reina-Aranza, Yuri, and Karina Acosta. Categorías municipales en Colombia: Avanzando hacia un modelo de descentralización asimétrica. Banco de la República, 2023. http://dx.doi.org/10.32468/dtseru.321.

Full text
Abstract:
La descentralización asimétrica se ha convertido en una discusión relevante en países en desarrollo como Colombia, donde las capacidades entre los gobiernos subnacionales difieren dramáticamente. Aunque estas discusiones han estado presentes desde la década de los sesenta, el éxito de la descentralización es aún una discusión relevante, donde la clasificación del territorio es fundamental. Este documento discute los posibles obstáculos de las clases territoriales usadas actualmente en Colombia. Asimismo, propone y discute la utilidad del uso de algoritmos recientes de la literatura de aprendizaje de máquinas no supervisados para la clasificación de los territorios subnacionales. Específicamente, este documento implementa Clustering via Optimal Trees (ICOT), un algoritmo que permite clasificar los territorios y, a la vez, identificar las reglas de las clases definidas. Este estudio además propone la creación de diferentes tipologías territoriales conforme a sus usos.
APA, Harvard, Vancouver, ISO, and other styles
2

Leimüller, Gertraud, Stefan Benke, and Lena Müller-Kress. Big Data, Algorithmen und AI: Datengetriebene Forschung in der Wissenschaft 2030. Rat für Forschung und Technologieentwicklung, 2020. http://dx.doi.org/10.22163/fteval.2020.611.

Full text
Abstract:
Welche Herausforderungen ergeben sich aus den raschen technologischen, organisatorischen und inhaltlichen Entwicklungen im Bereich datengetriebener Wissenschaft für österreichische Forschungseinrichtungen? Wie kann das österreichische Wissenschaftssystem, insbesondere Hochschulen und außerhochschulische Forschungseinrichtungen, nicht nur auf die digitale Datenrevolution vorbereitet werden, sondern auch international wettbewerbsfähig bleiben? Diese Fragen sind von großer Bedeutung für den Wissenschaftsstandort, wurden jedoch bisher wenig konkret untersucht. Sie stehen im Fokus einer Studie, die der Rat für Forschung und Technologieentwicklung (RFTE) im Jahr 2020 beauftragte. Durch die Anwendung von Open-Innovation-Methoden, die die Beteiligung von Experten und Betroffenen ermöglichen, hat das Projektteam von winnovation sieben große internationale Trends und Anforderungen datengetriebener Forschung erarbeitet, die in der folgenden Grafik zusammengefasst sind.
APA, Harvard, Vancouver, ISO, and other styles
3

Pessin, Gustavo. Algoritmos de prognóstico de falhas em correia transportadoras. Instituto Tecnológico Vale, 2023. http://dx.doi.org/10.29223/prod.tec.itv.mi.2023.36.ugucionifilho.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Krieger-Lamina, Jaro, ed. Wenn Algorithmen f�r uns entscheiden: Chancen und Risiken der k�nstlichen Intelligenz. Self, 2020. http://dx.doi.org/10.1553/10.3218/4002-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Filiz, Ibrahim, Jan René Judek, Marco Lorenz, and Markus Spiwoks. Die Tragik der Algorithm Aversion. Sonderforschungsgruppe Institutionenanalyse, 2021. http://dx.doi.org/10.46850/sofia.9783941627888.

Full text
Abstract:
Algorithmen bewältigen viele Aufgaben bereits zuverlässiger als menschliche Experten. Trotzdem zeigen einige Wirtschaftssubjekte eine ablehnende Haltung gegenüber Algorithmen (Algorithm Aversion). In manchen Entscheidungssituationen kann ein Fehler schwerwiegende Konsequenzen haben, in anderen Entscheidungssituationen nicht. Wir untersuchen im Rahmen eines Framing-Experimentes den Zusammenhang zwischen der Tragweite der Entscheidungssituation einerseits und der Häufigkeit der Algorithm Aversion andererseits. Dabei zeigt sich, dass die Algorithm Aversion umso häufiger auftritt, je gravierender die möglichen Konsequenzen einer Entscheidung sind. Gerade bei besonders wichtigen Entscheidungen führt somit die Algorithm Aversion zu einer Reduzierung der Erfolgswahrscheinlichkeit. Das kann man als die Tragik der Algorithm Aversion bezeichnen.
APA, Harvard, Vancouver, ISO, and other styles
6

Renó, D., and L. Renó. Algoritmo y noticia de datos como el futuro del periodismo transmediaimagético. Revista Latina de Comunicación Social, 2017. http://dx.doi.org/10.4185/rlcs-2017-1229.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Judek, Jan René. Die Bereitschaft zur Nutzung von Algorithmen variiert mit der sozialen Information über die schwache vs. starke Akzeptanz: Eine experimentelle Studie zur Algorithm Aversion. Sonderforschungsgruppe Institutionenanalyse, 2022. http://dx.doi.org/10.46850/sofia.9783947850037.

Full text
Abstract:
Der Prozess der Entscheidungsfindung wird in verschiedensten Kontexten immer häufiger von Algorithmen unterstützt. Das Phänomen der Algorithm Aversion steht der Entfaltung des technologischen Potenzials, das Algorithmen mit sich bringen, jedoch entgegen. Wirtschaftsakteure neigen dazu, ihre Entscheidungen an den Entscheidungen anderer Wirtschaftsakteure auszurichten. Daher wird in einem experimentellen Ansatz die Bereitschaft zur Nutzung eines Algorithmus bei der Abgabe von Aktienkursprognosen untersucht, wenn Informationen über die vorherige Nutzungsrate eines Algorithmus bereitgestellt werden. Es zeigt sich, dass Entscheidungsträger häufiger einen Algorithmus verwenden, wenn die Mehrheit der zuvor entscheidenden Wirtschaftsakteure diesen ebenfalls verwendet hat. Die Bereitschaft, einen Algorithmus zu verwenden, variiert mit der sozialen Information über die vorherige schwache beziehungsweise starke Akzeptanz. Zudem zeigt die Affinität zur Technikinteraktion der Wirtschaftsakteure einen Einfluss auf das Entscheidungsverhalten.
APA, Harvard, Vancouver, ISO, and other styles
8

Gubaydullina, Zulian, Jan René Judek, Marco Lorenz, and Markus Spiwoks. Gestaltungswille und Algorithm Aversion – Die Auswirkungen der Einflussnahme im Prozess der algorithmischen Entscheidungsfindung auf die Algorithm Aversion. Sonderforschungsgruppe Instituionenanalyse, 2021. http://dx.doi.org/10.46850/sofia.9783941627925.

Full text
Abstract:
Obwohl Algorithmen in vielen Anwendungsgebieten präzisere Prognosen abgeben als Menschen, weigern sich Entscheidungsträger häufig, auf Algorithmen zurückzugreifen. In einem ökonomischen Experiment untersuchen wir, ob das Ausmaß dieses als „Algorithm Aversion“ bekannten Phänomens reduziert werden kann, indem Entscheidungsträgern eine Einflussmöglichkeit auf die Ausgestaltung des Algorithmus eingeräumt wird (Einflussmöglichkeit auf den algorithmischen Input). Zusätzlich replizieren wir die Studie von Dietvorst, Simmons &amp; Massey (2018). Darin zeigt sich, dass die Algorithm Aversion deutlich zurückgeht, sofern die Subjekte am Ende die Ergebnisse des Algorithmus – und sei es nur um wenige Prozent – verändern können (Einflussmöglichkeit auf den algorithmischen Output). In der vorliegenden Studie bestätigt sich, dass die Algorithm Aversion bei einer Einflussmöglichkeit auf den algorithmischen Output signifikant zurückgeht. Eine Einflussmöglichkeit auf den algorithmischen Input scheint allerdings nur bedingt geeignet, die Algorithm Aversion zu reduzieren. Die begrenzte Möglichkeit zur Modifikation des algorithmischen Outputs reduziert die Algorithm Aversion effektiver als die Möglichkeit, Einfluss auf den algorithmischen Input zu nehmen.
APA, Harvard, Vancouver, ISO, and other styles
9

Túñez-Lopez, M., C. Toural-Bran, and C. Valdiviezo-Abad. Automatización, bots y algoritmos en la redacción de noticias. Impacto y calidad del periodismo artificial. Revista Latina de Comunicación Social, 2019. http://dx.doi.org/10.4185/rlcs-2019-1391.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

García Díaz, Helena, and María Belén Melián Batista. Metaheurísticas en Logística Sostenible. Fundación Avanza, 2023. http://dx.doi.org/10.60096/fundacionavanza/2362022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Algoritmen' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography