Log in

Relevant bibliographies by topics / Algoritmi

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Algoritmi'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 March 2023

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 'Algoritmi.'

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 "Algoritmi"

1

Nikšić, Bakir. "PREDIKCIJA INDEKSA KORISNOSTI IGRAČA U EVROLIGI." Zbornik radova Fakulteta tehničkih nauka u Novom Sadu 34, no. 01 (2018): 73–76. http://dx.doi.org/10.24867/01be17niksic.

Full text

Abstract:

Problem kojim se bavi ovaj rad jeste predikcija indeksa korisnosti igrača u euroligi. Ovaj rad nastoji da iskoristi veliku količinu podataka, koji se nalaze na oficijalnom sajtu evrolige, obradi ih i pripremi za upotrebu algoritama mašinskog učenja. Algoritmi koji su razmatrani u ovom radu su Naive Bayes, SVM (Support Vector Machine) i KNN (K nearest neighbours). Za svaki algoritam izvšena je optimizacija parametara koji najviše utiču na samu klasifikaciju. Osim navedenih algoritama mašinskog učenja, razmatrana su još dva jednostvna algoritma za predikciju indeksa korisnosti koje je implementirao autor. Najbolju tačnost od 92% postigao je algoritam SVM, dok su algoritmi Naive Bayes i KNN imali manju tačnost od 87%, odnosno 72%. Namenski razvijeni algoritmi imali su značajnije manju tačnost od algoritama mašinskog učenja.

APA, Harvard, Vancouver, ISO, and other styles

2

Bistrovs, Einārs, and Sergejs Kodors. "PATHFINDING ALGORITHMS." HUMAN. ENVIRONMENT. TECHNOLOGIES. Proceedings of the Students International Scientific and Practical Conference, no. 24 (April 22, 2020): 14–17. http://dx.doi.org/10.17770/het2020.24.6743.

Full text

Abstract:

Darbā ir aprakstīts salīdzinājums starp trim īsākā ceļa meklēšanas algotitmiem: A*, Deikstras algoritma, Plašas pirmās meklēšanas algoritma (Breadth first search). Algoritmi tika salīdzināti aplikācijā, kura ģenerē labirintus pēc gadījuma principa. Algoritmu izpildes laikā tiek iegūti trīs veidu dati – izpildes laiks, veikto operāciju skaits, ceļa garums.

APA, Harvard, Vancouver, ISO, and other styles

3

Pavlić, Miloš. "UČENJE USLOVLJAVANJEM UZ POŠTOVANJE SIGURNOSNIH MEHANIZAMA – STUDIJA SLUČAJA RADA UZ SIGURNOSNI PREKID." Zbornik radova Fakulteta tehničkih nauka u Novom Sadu 36, no. 01 (2020): 39–42. http://dx.doi.org/10.24867/11be02pavlic.

Full text

Abstract:

U oblasti učenja uslovljavanjem, već postoji dosta razvijenih algoritama. Naučnici predlažu da bi trebalo više uložiti u istraživanje sigurnosti primene ovakvih algoritama. Postoji nekoliko istraživanja koja pretvaraju ove probleme u tehničke specifikacije, čime omogućuju direktan napredak ovog polja. Fokus ovog rada je testiranje algoritama učenja uslovljavanjem i njihovih modifikacija (DQN, A2C i SAC Discrete) na poštovanje mehanizma sigurnosnog prekida. Okruženje u kome su algoritmi trenirani je deo AI Safety Gridworlds rada. Rezultati pokazuju da svi razmatrani algoritmi učenja uslovljavanjem poštuju sigurnosni prekid sa hiperparametarima predloženim u ovom radu, uz ograničenje da se trening mora pratiti i zaustaviti u pravom trenutku da bi algoritmi poštovali sigurnosni prekid.

APA, Harvard, Vancouver, ISO, and other styles

4

Pavlić, Miloš. "UČENJE USLOVLJAVANJEM UZ POŠTOVANJE SIGURNOSNIH MEHANIZAMA – STUDIJA SLUČAJA RADA UZ SIGURNOSNI PREKID." Zbornik radova Fakulteta tehničkih nauka u Novom Sadu 36, no. 01 (2020): 39–42. http://dx.doi.org/10.24867/11be02pavlic.

Full text

Abstract:

U oblasti učenja uslovljavanjem, već postoji dosta razvijenih algoritama. Naučnici predlažu da bi trebalo više uložiti u istraživanje sigurnosti primene ovakvih algoritama. Postoji nekoliko istraživanja koja pretvaraju ove probleme u tehničke specifikacije, čime omogućuju direktan napredak ovog polja. Fokus ovog rada je testiranje algoritama učenja uslovljavanjem i njihovih modifikacija (DQN, A2C i SAC Discrete) na poštovanje mehanizma sigurnosnog prekida. Okruženje u kome su algoritmi trenirani je deo AI Safety Gridworlds rada. Rezultati pokazuju da svi razmatrani algoritmi učenja uslovljavanjem poštuju sigurnosni prekid sa hiperparametarima predloženim u ovom radu, uz ograničenje da se trening mora pratiti i zaustaviti u pravom trenutku da bi algoritmi poštovali sigurnosni prekid.

APA, Harvard, Vancouver, ISO, and other styles

5

Keča, Milan. "TEHNIKE UMETNIČKOG MENJANJA SLIKE PRIMENOM DUBOKOG UČENJA." Zbornik radova Fakulteta tehničkih nauka u Novom Sadu 36, no. 03 (2021): 544–47. http://dx.doi.org/10.24867/12be42keca.

Full text

Abstract:

U ovom radu su predstavljene metoda umetničkog menjanja stila slika. Metode se baziraju na upotrebi pretreniranih konvolucionih neuronskih mreža za prepoznavanje sadržaja i stila slika. Predstavljeni su iterativni algoritmi, prenos stila i Deep Dream, kao i njihova unapređenja. Analizirano je ponašanje algoritama menjajući parametre algoritma i komentarisani su rezultati. Implementacija svih algoritama je izvršena u programskom jeziku Python i paketu Tensorflow.

APA, Harvard, Vancouver, ISO, and other styles

6

Trpovski, Sonja, and Saša Lalić. "ANALIZA PERFORMANSI ALGORITAMA UČENJA USLOVLJAVANJEM U OKVIRU STARCRAFT 2 OKRUŽENJA." Zbornik radova Fakulteta tehničkih nauka u Novom Sadu 34, no. 03 (2019): 590–93. http://dx.doi.org/10.24867/02be34lalic.

Full text

Abstract:

Ovaj rad se bavi analizom performansi algoritama učenja uslovljavanjem pri rešavanju problema iz kompjuterske igre Starcraft 2. Algoritmi koji su implementirani i poređeni su A3C i Deep-Q Learning. Za svaki algoritam ispitan je uticaj različitih parametara obuke, kao što su broj preskočenih koraka agenta, i stopa učenja neuronske mreže. Pokazalo se da oba algoritma reaguju isto na promene parametara, i da u problemima koji ne zahtevaju česte akcije da bi dostiglo optimalno rešenje, preskakanje većeg broja akcija ubrzava obuku algoritma, i dovodi do boljeg rešenja u istom vremenskom periodu za obuku. Dok smanjenje stope učenja dovodi do lošijeg rešenja u svim slučajevima. Oba algoritma su postigli rezultate u problemima upravljanja jedinica, ali nisu postigli značajne rezultate u izgradnji baze.

APA, Harvard, Vancouver, ISO, and other styles

7

Rakić, Vladan. "ENEL OPTIMALNA REKONFIGURACIJA MREŽE." Zbornik radova Fakulteta tehničkih nauka u Novom Sadu 34, no. 09 (2019): 1563–66. http://dx.doi.org/10.24867/04be14rakic.

Full text

Abstract:

U radu je prikazan problem optimalne rekonfiguracije mreža sa osvrtom na minimalne gubitke aktivne električne energije kao optimizacionog kriterijuma. Detaljno su opisani algoritmi za proračune tokova snaga, proračune gubitaka električne energije i algoritam izmene grana za optimalnu rekonfiguraciju mreže koji objedinjeni sačinjavaju inovativni pristup rešenja postavljenog problema pod nazivom Enel optimalna rekonfiguracija mreža. Na kraju je izvršena verifikacija izloženog algoritma na test mreži.

APA, Harvard, Vancouver, ISO, and other styles

8

Trkulja, Branislav. "IMPLEMENTACIJA I TESTIRANJE ALGORITAMA ZA TAČNO PODUDARANJE STRINGOVA." Zbornik radova Fakulteta tehničkih nauka u Novom Sadu 35, no. 03 (2020): 620–23. http://dx.doi.org/10.24867/07be48trkulja.

Full text

Abstract:

U radu su opisani algoritmi koji su najčešće u upotrebi za tačno podudaranje stringova. Razmatrani su “Brute force” metoda, algoritam Rabin-Karp, Knuth-Morris-Pratt i Boyer Moore algoritam. Nabrojani algoritmi su implementirani u C# programskom jeziku i izvršena su testiranja njihovih performasi. Rad sadrži rezultate dobijene testiranjem nad dve vrste testnih podataka. Jedna vrsta podataka su veštački generisani primeri koji treba da istaknu dobre i loše strane algoritama, dok drugu vrstu podataka čine realni primeri: tekst knjige „Rat i mir“ i CIM/XML fajl sa 2GB podataka.

APA, Harvard, Vancouver, ISO, and other styles

9

Karimov, Suyun, Sami Qobilov, and Ilyos Rabbimov. "AVTOMATIK LUG'ATLAR HOSIL QILISH ALGORITMI." COMPUTER LINGUISTICS: PROBLEMS, SOLUTIONS, PROSPECT 1, no. 1 (2021): 129–33. http://dx.doi.org/10.52773/cl:psp/vol_1_issue_1/a26.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Nicosia, Giovanni Giuseppe. "Algoritmi spontanei in classi multiculturali." Didattica della matematica. Dalla ricerca alle pratiche d’aula, no. 4 (2018): 100–115. http://dx.doi.org/10.33683/ddm.18.4.6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Algoritmi"

1

Scaravelli, Arianna. "Algoritmi per la generazione di permutazioni e algoritmi di ordinamento." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2020.

Find full text

Abstract:

In questa tesi si analizzano due algoritmi per la generazione di permutazioni: uno che le genera in ordine lessicografico ed un altro che genera permutazioni a motivo 231 escluso. Si ha un breve accenno ai Numeri di Catalan. Successivamente viene studiato il metodo di ordinamento di permutazioni tramite una e più pile. Infine vengono esaminate le proprietà di simmetria e unimodalità delle permutazioni ordinabili mediante t pile, con un approfondimento sugli alberi binari.

APA, Harvard, Vancouver, ISO, and other styles

2

Frisoni, Federica. "Algoritmi e ricorsività: macchine di Turing e algoritmi di Markov." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amslaurea.unibo.it/7247/.

Full text

Abstract:

In questa questa tesi vengono presentate alcune delle più importanti definizioni di funzione computabile mediante un algoritmo: una prima descrizione è quella data tramite le funzioni ricorsive, un secondo approccio è dato in termini di macchine di Turing, infine, vengono considerati gli algoritmi di Markov. Si dimostra che tutte queste definizioni sono equivalenti. Completa la tesi un breve cenno al lambda-K-calcolo.

APA, Harvard, Vancouver, ISO, and other styles

3

Ragni, Stefano. "Algoritmi dell'informazione quantistica." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/15454/.

Full text

Abstract:

Lo scopo di questa tesi è presentare alcuni algoritmi di base che rivestono grande importanza nell'ambito della computazione quantistica. La trattazione teorica viene accompagnata da codici eseguibili in QISKit, uno strumento che IBM mette a libera disposizione di studenti e docenti universitari: scopo ulteriore della tesi è saggiare le possibilità offerte dal toolkit, la sua semplicità di utilizzo e di conseguenza la sua validità come supporto didattico. Il capitolo centrale sugli algoritmi sarà preceduto da una breve presentazione dei fondamenti della meccanica quantistica necessari per la comprensione dei sistemi a due stati e da una piccola presentazione di QISKit. Saranno analizzati nel dettaglio la procedura di teletrasporto quantistico e gli algoritmi della trasformata di Fourier quantistica e della stima di fase.

APA, Harvard, Vancouver, ISO, and other styles

4

Emiliani, Luca. "Algoritmi MPPT per impianti fotovoltaici." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amslaurea.unibo.it/6517/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Gatti, Lorenzo. "Algoritmi quantistici e classi di complessità." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9128/.

Full text

Abstract:

Solitamente il concetto di difficoltà è piuttosto soggettivo, ma per un matematico questa parola ha un significato diverso: anche con l’aiuto dei più potenti computer può essere impossibile trovare la soluzione di un sudoku, risolvere l’enigma del commesso viaggiatore o scomporre un numero nei suoi fattori primi; in questo senso le classi di complessità computazionale quantificano il concetto di difficoltà secondo le leggi dell’informatica classica. Una macchina quantistica, però, non segue le leggi classiche e costituisce un nuovo punto di vista in una frontiera della ricerca legata alla risoluzione dei celebri problemi del millennio: gli algoritmi quantistici implementano le proprietà straordinarie e misteriose della teoria dei quanti che, quando applicate lucidamente, danno luogo a risultati sorprendenti.

APA, Harvard, Vancouver, ISO, and other styles

6

Rinaldi, Andrea. "Algoritmi di Compressione secondo Lempel Ziv." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9150/.

Full text

Abstract:

Molti metodi di compressione lossless si basano sulle idee che nel 1977 i ricercatori israeliani Abraham Lempel e Jacob Ziv hanno presentato nell’articolo “A universal Algorithm for sequential Data Compression”. In questa tesi viene descritto il metodo di fattorizzazione LZ77, illustrato appunto da Lempel e Ziv, e vengono esposte le strutture dati fondamentali per la sua realizzazione. Sono inoltre descritti due algoritmi CPS1 e CPS2 che realizzano LZ77. Infine, sfruttando i dati raccolti sperimentalmente da Al-Haffedh et al. in “A Comparison of Index-Based Lempel-Ziv LZ77 Factorization Algorithms” [2012], gli algoritmi descritti vengono confrontati in termini di spazio e tempo.

APA, Harvard, Vancouver, ISO, and other styles

7

Vannucci, Maria Chiara. "Algoritmi di segmentazione di immagini mediche." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amslaurea.unibo.it/10878/.

Full text

Abstract:

Nell'ambito dell'elaborazione delle immagini, si definisce segmentazione il processo atto a scomporre un'immagine nelle sue regioni costituenti o negli oggetti che la compongono. Ciò avviene sulla base di determinati criteri di appartenenza dei pixel ad una regione. Si tratta di uno degli obiettivi più difficili da perseguire, anche perché l'accuratezza del risultato dipende dal tipo di informazione che si vuole ricavare dall'immagine. Questa tesi analizza, sperimenta e raffronta alcune tecniche di elaborazione e segmentazione applicate ad immagini digitali di tipo medico. In particolare l'obiettivo di questo studio è stato quello di proporre dei possibili miglioramenti alle tecniche di segmentazione comunemente utilizzate in questo ambito, all'interno di uno specifico set di immagini: tomografie assiali computerizzate (TAC) frontali e laterali aventi per soggetto ginocchia, con ivi impiantate protesi superiore e inferiore. L’analisi sperimentale ha portato allo sviluppo di due algoritmi in grado di estrarre correttamente i contorni delle sole protesi senza rilevare falsi punti di edge, chiudere eventuali gap, il tutto a un basso costo computazionale.

APA, Harvard, Vancouver, ISO, and other styles

8

Merlo, Riccardo. "Ottimizzazione di algoritmi per l'Outlier Detection." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017.

Find full text

Abstract:

Si è partiti da un algoritmo noto per l'outlier detection (solvingset), al quale sono state applicate delle ottimizzazioni algoritmiche. La fase di testing ha evidenziato discrepanze significative tra gli speedup dei tempi e quelli delle distanze. Sono quindi state fatte analisi prestazionali aggiuntive, con degli strumenti chiamati profiler, per individuare i colli di bottiglia e gli overhead generati dall'algoritmo. Tali analisi hanno evidenziato la presenza di overhead non facilmente eliminabile che mitigano i teorici vantaggi temporali ottenibili dall'applicazione di ottimizzazioni algoritmicamente valide.

APA, Harvard, Vancouver, ISO, and other styles

9

Cangini, Nicolò. "Quantum Supervised Learning: Algoritmi e implementazione." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/17694/.

Full text

Abstract:

Il Quantum Computing non riguarda più soltanto la scienza della Fisica, negli ultimi anni infatti la ricerca in questo campo ha subito una notevole espansione dimostrando l'enorme potenziale di cui dispongono questi nuovi calcolatori che in un futuro prossimo potranno rivoluzionare il concetto di Computer Science così come lo conosciamo. Ad oggi, siamo già in grado di realizzare algoritmi su piccola scala eseguibili in un quantum device grazie ai quali è possibile sperimentare uno speed-up notevole (in alcuni casi esponenziale) su diversi task tipici della computazione classica. In questo elaborato vengono discusse le basi del Quantum Computing, con un focus particolare sulla possibilità di eseguire alcuni algoritmi supervisionati di Machine Learning in un quantum device per ottenere uno speed-up sostanziale nella fase di training. Oltre che una impostazione teorica del problema, vengono effettuati diversi esperimenti utilizzando le funzionalità dell'ambiente Qiskit, grazie al quale è possibile sia simulare il comportamento di un computer quantistico in un calcolatore classico, sia eseguirlo in cloud sui computer messi a disposizione da IBM.

APA, Harvard, Vancouver, ISO, and other styles

10

Retico, Alessandro. "Algoritmi paralleli per l'allineamento di immagini." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/19101/.

Full text

Abstract:

In questa tesi si propone un algoritmo che, date una serie di immagini astronomiche raffiguranti uno stesso soggetto, cerca di ricavarne una rappresentazione migliore. Scattare foto astronomiche non è affatto facile: bisogna seguire vari accorgimenti e regolare opportunamente le impostazioni della propria fotocamera. In genere gli astrofili, che non sempre dispongono di sofisticatissime attrezzature per fotografare lo spazio, scattano una serie di foto o registrano un video (da cui estrarranno i fotogrammi) del soggetto che vogliono immortalare, attraverso la lente di un telescopio: in questa maniera riescono a catturare dettagli invisibili all'occhio umano, ma le immagini ottenute presentano parecchio rumore; per questo motivo le astrofotografie sono quasi sempre sottoposte ad una fase di elaborazione. Una semplice procedura per ridurre il rumore consiste nel produrre una nuova immagine i cui pixel abbiano valore pari alla media dei corrispettivi pixel di tutte le immagini scattate. Dato che la tecnica di cattura precedentemente descritta è enormemente sensibile allo spostamento, prima di calcolare la media dei pixel, è necessario allineare le immagini, rimuovendo lo scostamento presente tra esse. Per effettuare questo procedimento (noto anche come image registration) esistono varie tecniche più o meno complicate: in questa tesi ne verranno presentate brevemente alcune, ma ci si limiterà ad implementarne una versione banale, basata su una tecnica di brute force. La tematica affrontata si presta molto bene alla programmazione parallela, perciò l'implementazione dell'algoritmo che verrà proposto sfrutterà le clausole OpenMP e le istruzioni SIMD di un Raspberry Pi 2 B; è stata scelta tale architettura date le notevoli capacità di parallelizzazione che è in grado di offrire nonostante i ridotti costi, le contenute dimensioni e la minima energia richiesta.

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Algoritmi"

1

Harel, David, and Yishai Feldman. Algoritmi. Springer Milan, 2008. http://dx.doi.org/10.1007/978-88-470-0580-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Toffalori, Carlo. Algoritmi. Il mulino, 2015.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Stollo, Stella. Algoritmi di Capodanno. ARPANet, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Yishai, Feldman, ed. Algoritmi: Lo spirito dell’informatica. Springer Milan, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Jens, Vygen, and SpringerLink (Online service), eds. Ottimizzazione Combinatoria: Teoria e Algoritmi. Springer Milan, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Luccio, Fabrizio. Algoritmi, divinità e gente comune. ETS, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Roshka, A. N. Algoritmi ai tranziției: Aspecte social-filozofice. Academia de Științe a Moldovei, Institutul de Filozofie, Sociologie și Științe Politice, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Goodrich, Michael T. Strutture dati e algoritmi in Java. Zanichelli, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Modelli e algoritmi della ricerca operativa. FrancoAngeli, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Makkonell, Dzh. Analiz algoritmov: Vvodnyi kurs. Tikhnosfera, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Algoritmi"

1

Harel, David, and Yishai Feldman. "Introduzione e revisione storica." In Algoritmi. Springer Milan, 2008. http://dx.doi.org/10.1007/978-88-470-0580-8_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Harel, David, and Yishai Feldman. "Parallelismo, Concorrenza e modelli alternativi." In Algoritmi. Springer Milan, 2008. http://dx.doi.org/10.1007/978-88-470-0580-8_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Harel, David, and Yishai Feldman. "Algoritmi probabilistici." In Algoritmi. Springer Milan, 2008. http://dx.doi.org/10.1007/978-88-470-0580-8_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Harel, David, and Yishai Feldman. "Crittografia e Interazioni affidabili." In Algoritmi. Springer Milan, 2008. http://dx.doi.org/10.1007/978-88-470-0580-8_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Harel, David, and Yishai Feldman. "Ingegneria del software." In Algoritmi. Springer Milan, 2008. http://dx.doi.org/10.1007/978-88-470-0580-8_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Harel, David, and Yishai Feldman. "Sistemi reattivi." In Algoritmi. Springer Milan, 2008. http://dx.doi.org/10.1007/978-88-470-0580-8_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Harel, David, and Yishai Feldman. "Algoritmi e Intelligenza." In Algoritmi. Springer Milan, 2008. http://dx.doi.org/10.1007/978-88-470-0580-8_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Harel, David, and Yishai Feldman. "Poscritto." In Algoritmi. Springer Milan, 2008. http://dx.doi.org/10.1007/978-88-470-0580-8_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Harel, David, and Yishai Feldman. "Soluzioni." In Algoritmi. Springer Milan, 2008. http://dx.doi.org/10.1007/978-88-470-0580-8_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Harel, David, and Yishai Feldman. "Note bibliografiche." In Algoritmi. Springer Milan, 2008. http://dx.doi.org/10.1007/978-88-470-0580-8_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algoritmi"

1

Cheney-Lippold, John. "Jus Algoritmi: How the NSA Remade Citizenship." In ISIS Summit Vienna 2015—The Information Society at the Crossroads. MDPI, 2015. http://dx.doi.org/10.3390/isis-summit-vienna-2015-t3.3004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Rodrigues, Nelson, Inês Teixeira, Violeta Carvalho, et al. "Summer Grants ‘Verão Com Ciência’, From Foundation for Science and Technology, in Portugal: Experience and Achievements." In ASME 2022 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/imece2022-96056.

Full text

Abstract:

Abstract Following up the call for research projects launched by the Foundation for Science and Technology (FCT) after the first pandemic event in Portugal, and bearing in mind the positive results obtained, during the summer of 2021, a new call was launched with a shorter duration. During one month just before starting the university academic year, undergraduate students could join a research team in a research lab, and by applying a “learning by doing” approach, students experienced a research atmosphere and got involved with the main activities being developed by the research group. For engineering students, this is an opportunity to bring theory to practice, get experience, and ingress into research teamwork. This paper presents and discusses the main achievements of this initiative, in particular, the research experience of three undergraduate students and their host research teams, from the Algoritmi center, from the School of Engineering of the University of Minho, Portugal. The students’ opinions on the developed projects were quite satisfactory and they recognized that joining this type of scholarship opens horizons, promotes an inquiring spirit, teaches research strategies and, above all, students can see their knowledge applied to engineering research and on the advancement of science.

APA, Harvard, Vancouver, ISO, and other styles

3

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

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

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

6

Borjesson, Fredrik, and Katja Hölttä-Otto. "Improved Clustering Algorithm for Design Structure Matrix." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70076.

Full text

Abstract:

For clustering a large Design Structure Matrix (DSM), computerized algorithms are necessary. A common algorithm by Thebeau uses stochastic hill-climbing to avoid local optima. The output of the algorithm is stochastic, and to be certain a very good clustering solution has been obtained, it may be necessary to run the algorithm thousands of times. To make this feasible in practice, the algorithm must be computationally efficient. Two algorithmic improvements are presented. Together they improve the quality of the results obtained and increase speed significantly for normal clustering problems. The proposed new algorithm is applied to a cordless handheld vacuum cleaner.

APA, Harvard, Vancouver, ISO, and other styles

7

Hulicki, Maciej. "ALGORITHM TRANSPARENCY AS A SINE QUA NON PREREQUISITE FOR A SUSTAINABLE COMPETITION IN A DIGITAL MARKET?" In International Jean Monnet Module Conference of EU and Comparative Competition Law Issues "Competition Law (in Pandemic Times): Challenges and Reforms. Faculty of Law, Josip Juraj Strossmayer University of Osijek, 2021. http://dx.doi.org/10.25234/eclic/18823.

Full text

Abstract:

Algorithms play a fundamental role in the digital economy. Their impact on the situation of market participants is significant. Hence, ensuring transparency of algorithms, through access to them, is crucial for the proper functioning of the market. Several models of algorithmic transparency are analyzed in the paper: from lack of transparency to complete regulation of algorithms. In particular, transparency through explanation, and “on-demand transparency” were proposed. The goal of the paper is to determine the optimal form and scope of regulation of this area, in order to ensure sustainable competition in the digital market. Hence, the paper focuses on the concept of algorithmic transparency, the nature of the competition in the digital market, the role of algorithms within the digital trade, and problems related to the regulation of algorithms. This allows to answering the question of whether algorithmic transparency is an indispensable condition for sustainable competition in the digital market, and what are the legal challenges, which may arise with respect to various models of algorithm transparency. The paper is embedded within the EU legal framework, discusses new legislative developments in the EU law, such as the proposal for the Digital Markets Act, and includes analysis of EU antitrust case-law and market practices.

APA, Harvard, Vancouver, ISO, and other styles

8

Palioto, Narcizo Gabriel Freitas, and Thelma Colanzi. "Configuração de Algoritmos Genéticos Multiobjetivos para Otimização de Projeto de Arquitetura de Linha de Produto." In Escola Regional de Engenharia de Software. Sociedade Brasileira de Computação, 2020. http://dx.doi.org/10.5753/eres.2020.13731.

Full text

Abstract:

Algoritmos de busca têm sido explorados com sucesso na otimização de projeto de Arquitetura de Linha de Produto de Software (PLA) na abordagem seminal chamada Multi-Objective Approach for Product-Line Architecture Design (MOA4PLA). Tal abordagem produz um conjunto de alternativas de projeto de PLA que melhora os diferentes fatores otimizados. Atualmente, o algoritmo utilizado nesta abordagem é o algoritmo NSGA-II (Non-dominated Sorting Genetic Algorithm II), um algoritmo genético multiobjetivo que otimiza várias propriedades simultaneamente. Apesar de resultados experimentais promissores, estudar a melhor combinação de configuração dos parâmetros do algoritmo genético é imprescindível para obter melhores resultados. Valores de referência para os parâmetros ainda não foram definidos para otimização de projeto de PLA porque este é um tópico de pesquisa incipiente. Nesse contexto, o objetivo deste trabalho é identificar os valores mais adequados para configurar o algoritmo NSGA-II para a otimização de projetos de PLA por meio de um estudo experimental. Uma análise quantitativa baseada no indicador de qualidade hypervolume e em testes estatísticos foi realizada para determinar o valor mais adequado para configurar cada parâmetro do algoritmo.

APA, Harvard, Vancouver, ISO, and other styles

9

Danks, David, and Alex John London. "Algorithmic Bias in Autonomous Systems." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/654.

Full text

Abstract:

Algorithms play a key role in the functioning of autonomous systems, and so concerns have periodically been raised about the possibility of algorithmic bias. However, debates in this area have been hampered by different meanings and uses of the term, "bias." It is sometimes used as a purely descriptive term, sometimes as a pejorative term, and such variations can promote confusion and hamper discussions about when and how to respond to algorithmic bias. In this paper, we first provide a taxonomy of different types and sources of algorithmic bias, with a focus on their different impacts on the proper functioning of autonomous systems. We then use this taxonomy to distinguish between algorithmic biases that are neutral or unobjectionable, and those that are problematic in some way and require a response. In some cases, there are technological or algorithmic adjustments that developers can use to compensate for problematic bias. In other cases, however, responses require adjustments by the agent, whether human or autonomous system, who uses the results of the algorithm. There is no "one size fits all" solution to algorithmic bias.

APA, Harvard, Vancouver, ISO, and other styles

10

Pratuzaitė, Greta, and Nijolė Maknickienė. "Investigation of credit cards fraud detection by using deep learning and classification algorithms." In 11th International Scientific Conference „Business and Management 2020“. VGTU Technika, 2020. http://dx.doi.org/10.3846/bm.2020.558.

Full text

Abstract:

Criminal financial behaviour is a problem for both banks and newly created fintech companies. Credit card fraud detection becomes a challenge for any such company. The aim of this paper is to com-pare ability to detect credit card fraud by four algorithmic methods: Generalized method of moments, K-nearest neighbour, Naive Bayes classification and Deep learning. The deep learning algorithm has been tuned to select key parameters so that fraud detection accuracy is the best. Five recognition accuracy parameters and a cost calcualtions showed that the deep learning algorithm is the best fraud detection meth-od compared to other classification algorithms. A financial company reduces losses and increases customer confidence by using fraud prevention technologies.

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Algoritmi"

1

Johansen, Richard A., Christina L. Saltus, Molly K. Reif, and Kaytee L. Pokrzywinski. A Review of Empirical Algorithms for the Detection and Quantification of Harmful Algal Blooms Using Satellite-Borne Remote Sensing. U.S. Army Engineer Research and Development Center, 2022. http://dx.doi.org/10.21079/11681/44523.

Full text

Abstract:

Harmful Algal Blooms (HABs) continue to be a global concern, especially since predicting bloom events including the intensity, extent, and geographic location, remain difficult. However, remote sensing platforms are useful tools for monitoring HABs across space and time. The main objective of this review was to explore the scientific literature to develop a near-comprehensive list of spectrally derived empirical algorithms for satellite imagers commonly utilized for the detection and quantification HABs and water quality indicators. This review identified the 29 WorldView-2 MSI algorithms, 25 Sentinel-2 MSI algorithms, 32 Landsat-8 OLI algorithms, 9 MODIS algorithms, and 64 MERIS/Sentinel-3 OLCI algorithms. This review also revealed most empirical-based algorithms fell into one of the following general formulas: two-band difference algorithm (2BDA), three-band difference algorithm (3BDA), normalized-difference chlorophyll index (NDCI), or the cyanobacterial index (CI). New empirical algorithm development appears to be constrained, at least in part, due to the limited number of HAB-associated spectral features detectable in currently operational imagers. However, these algorithms provide a foundation for future algorithm development as new sensors, technologies, and platforms emerge.

APA, Harvard, Vancouver, ISO, and other styles

2

Baader, Franz, and Rafael Peñaloza. Axiom Pinpointing in General Tableaux. Aachen University of Technology, 2007. http://dx.doi.org/10.25368/2022.159.

Full text

Abstract:

Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL. The purpose of this paper is to develop a general approach for extending a tableau-based algorithm to a pinpointing algorithm. This approach is based on a general definition of „tableaux algorithms,' which captures many of the known tableau-based algorithms employed in DLs, but also other kinds of reasoning procedures.

APA, Harvard, Vancouver, ISO, and other styles

3

Baader, Franz, and Rafael Peñaloza. Pinpointing in Terminating Forest Tableaux. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.166.

Full text

Abstract:

Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL. The purpose of this paper is to develop a general approach for extending a tableau-based algorithm to a pinpointing algorithm. This approach is based on a general definition of „tableau algorithms,' which captures many of the known tableau-based algorithms employed in DLs, but also other kinds of reasoning procedures.

APA, Harvard, Vancouver, ISO, and other styles

4

Baader, Franz, and Rafael Peñaloza. Blocking and Pinpointing in Forest Tableaux. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.165.

Full text

Abstract:

Axiom pinpointing has been introduced in description logics (DLs) to help the used understand the reasons why consequences hold by computing minimal subsets of the knowledge base that have the consequence in consideration. Several pinpointing algorithms have been described as extensions of the standard tableau-based reasoning algorithms for deciding consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL, using specific traits of them. In the past, we have developed a general approach for extending tableau-based algorithms into pinpointing algorithms. In this paper we explore some issues of termination of general tableaux and their pinpointing extensions. We also define a subclass of tableaux that allows the use of so-called blocking conditions, which stop the execution of the algorithm once a pattern is found, and adapt the pinpointing extensions accordingly, guaranteeing its correctness and termination.

APA, Harvard, Vancouver, ISO, and other styles

5

Lorenz, Markus. Auswirkungen des Decoy-Effekts auf die Algorithm Aversion. Sonderforschungsgruppe Institutionenanalyse, 2022. http://dx.doi.org/10.46850/sofia.9783947850013.

Full text

Abstract:

Limitations in the human decision-making process restrict the technological potential of algorithms, which is also referred to as "algorithm aversion". This study uses a laboratory experiment with participants to investigate whether a phenomenon known since 1982 as the "decoy effect" is suitable for reducing algorithm aversion. For numerous analogue products, such as cars, drinks or newspaper subscriptions, the Decoy Effect is known to have a strong influence on human decision-making behaviour. Surprisingly, the decisions between forecasts by humans and Robo Advisors (algorithms) investigated in this study are not influenced by the Decoy Effect at all. This is true both a priori and after observing forecast errors.

APA, Harvard, Vancouver, ISO, and other styles

6

Lewis, Dustin, Naz Modirzadeh, and Gabriella Blum. War-Algorithm Accountability. Harvard Law School Program on International Law and Armed Conflict, 2016. http://dx.doi.org/10.54813/fltl8789.

Full text

Abstract:

In War-Algorithm Accountability (August 2016), we introduce a new concept—war algorithms—that elevates algorithmically-derived “choices” and “decisions” to a, and perhaps the, central concern regarding technical autonomy in war. We thereby aim to shed light on and recast the discussion regarding “autonomous weapon systems” (AWS). We define “war algorithm” as any algorithm that is expressed in computer code, that is effectuated through a constructed system, and that is capable of operating in relation to armed conflict. In introducing this concept, our foundational technological concern is the capability of a constructed system, without further human intervention, to help make and effectuate a “decision” or “choice” of a war algorithm. Distilled, the two core ingredients are an algorithm expressed in computer code and a suitably capable constructed system. Through that lens, we link international law and related accountability architectures to relevant technologies. We sketch a three-part (non-exhaustive) approach that highlights traditional and unconventional accountability avenues. We focus largely on international law because it is the only normative regime that purports—in key respects but with important caveats—to be both universal and uniform. In this way, international law is different from the myriad domestic legal systems, administrative rules, or industry codes that govern the development and use of technology in all other spheres. By not limiting our inquiry only to weapon systems, we take an expansive view, showing how the broad concept of war algorithms might be susceptible to regulation—and how those algorithms might already fit within the existing regulatory system established by international law.

APA, Harvard, Vancouver, ISO, and other styles

7

Baader, Franz, Jan Hladik, and Rafael Peñaloza. PSpace Automata with Blocking for Description Logics. Aachen University of Technology, 2006. http://dx.doi.org/10.25368/2022.157.

Full text

Abstract:

In Description Logics (DLs), both tableau-based and automatabased algorithms are frequently used to show decidability and complexity results for basic inference problems such as satisfiability of concepts. Whereas tableau-based algorithms usually yield worst-case optimal algorithms in the case of PSpace-complete logics, it is often very hard to design optimal tableau-based algorithms for ExpTime-complete DLs. In contrast, the automata-based approach is usually well-suited to prove ExpTime upper-bounds, but its direct application will usually also yield an ExpTime-algorithm for a PSpace-complete logic since the (tree) automaton constructed for a given concept is usually exponentially large. In the present paper, we formulate conditions under which an on-the-fly construction of such an exponentially large automaton can be used to obtain a PSpace-algorithm. We illustrate the usefulness of this approach by proving a new PSpace upper-bound for satisfiability of concepts w.r.t. acyclic terminologies in the DL SI, which extends the basic DL ALC with transitive and inverse roles.

APA, Harvard, Vancouver, ISO, and other styles

8

Housley, R. Guidelines for Cryptographic Algorithm Agility and Selecting Mandatory-to-Implement Algorithms. RFC Editor, 2015. http://dx.doi.org/10.17487/rfc7696.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Pirohov, Vladyslav M., Anna M. Horlo, and Iryna S. Mintii. Software development of the algorithm of adaptating of the website design for people with color-blindness. [б. в.], 2018. http://dx.doi.org/10.31812/123456789/2888.

Full text

Abstract:

The purpose of the study is the program implementation of the basic algorithms of the website design adaptation for people with color perception. This article examines the implementation of the following algorithms: the conversion algorithm from the rgb color model to the lms model (there is a special algorithm precisely in the color model lms for modeling various types of color perception violations), simulation of different color blindness types in the lms-model (this is the transformation of normal values in the color model lms to values with different types of color perception violations), convert data from lms color model to rgb model, conversion from color rgb to hsl model, color filtering in hsl-model and conversion from hsl model to rgb color model.

APA, Harvard, Vancouver, ISO, and other styles

10

Jenkins, M. Using Commercial National Security Algorithm Suite Algorithms in Secure/Multipurpose Internet Mail Extensions. RFC Editor, 2020. http://dx.doi.org/10.17487/rfc8755.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!