To see the other types of publications on this topic, follow the link: Algoritmes.

Journal articles on the topic 'Algoritmes'

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Algoritmes.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

van Winsen, Arthur. "Algoritmes." Tandartspraktijk 39, no. 4 (2018): 23. http://dx.doi.org/10.1007/s12496-018-0059-5.

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

van Tongeren, Bart. "Algoritmes in de rechtsstaat." Advocatenblad 97, no. 8 (2017): 114. http://dx.doi.org/10.5553/ab/0165-13312017097008034.

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

Stikker, Marleen. "Ook algoritmes verdienen een toezichthouder." Bestuurskunde 26, no. 3 (2017): 43–44. http://dx.doi.org/10.5553/bk/092733872017026003004.

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

Shaw, I. S. "Inleiding tot die toepassing van genetiese algoritmes in ingenieurswese." Suid-Afrikaanse Tydskrif vir Natuurwetenskap en Tegnologie 17, no. 3 (1998): 112–17. http://dx.doi.org/10.4102/satnt.v17i3.699.

Full text
Abstract:
Genetic algorithms constitute a new research area in the field of artificial intelligence. This work is aimed at their application in specific areas of engineering where good results have already been achieved. The purpose of this work is to provide a basic introduction for students as well as experienced engineers who wish to upgrade their knowledge. A distinctive feature of artificial intelligence is that instead of mathematical models, either direct human experience or certain functions of the human brain for the modelling of physical phenomena are used.
APA, Harvard, Vancouver, ISO, and other styles
5

van Kolfschooten, H. B. "Eerste stappen in Europese regulering van artificiële intelligentie: algoritmes en patiëntenrechten." Tijdschrift voor Gezondheidsrecht 45, no. 4 (2021): 381–89. http://dx.doi.org/10.5553/tvgr/016508742021045004008.

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

Geeraerts, A., T. Dilles, V. Foulon, et al. "Ontwikkeling van algoritmes voor oordeelkundig gebruik van psychofarmaca bij ouderen met verhoogd valrisico." Tijdschrift voor Gerontologie en Geriatrie 48, no. 5 (2017): 195–202. http://dx.doi.org/10.1007/s12439-017-0229-1.

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

Klous, Sander, and Nart Wielaard. "Big data creëert nieuwe rol voor financials." Maandblad Voor Accountancy en Bedrijfseconomie 89, no. 11 (2015): 421–25. http://dx.doi.org/10.5117/mab.89.31198.

Full text
Abstract:
Big data biedt op een breed front nieuwe mogelijkheden die we momenteel gaandeweg aan het ontdekken zijn. Een van de onderbelichte domeinen is de impact op 1nanciële professionals zoals accountants en controllers. Nu alles meetbaar wordt lijdt het eigenlijk geen twijfel dat er een radicaal andere benadering komt voor het genereren – en controleren – van managementinformatie. Dat komt niet alleen doordat we informatiestromen naadloos aan elkaar kunnen knopen met slimme algoritmes en daarmee ef1ciencywinst kunnen boeken. Het komt ook doordat we nieuwe (voorspellende) inzichten kunnen generen die
APA, Harvard, Vancouver, ISO, and other styles
8

Jans, Mieke, and Marzie Hosseinpour. "Process mining-technieken voor internecontroletesten - mogelijkheden nu en in de toekomst." Maandblad Voor Accountancy en Bedrijfseconomie 91, no. 3/4 (2017): 90–95. http://dx.doi.org/10.5117/mab.91.24025.

Full text
Abstract:
‘Data analytics' en ‘accounting' zijn termen die steeds vaker in combinatie worden gebruikt. Zowel van de financiële rapportering als van de processen die leiden tot deze rapportering worden steeds meer gegevens opgeslagen. Dat data-analyse een toegevoegde waarde kan bieden aan accounting, wordt door steeds meer partijen aangenomen. Hoe deze toegevoegde waarde concreet bereikt kan worden, is echter minder duidelijk. In dit artikel wordt concreet ingegaan op het perspectief van internecontroletesten en process mining, een subset van data-analysetechnieken. Enerzijds worden concrete activiteiten
APA, Harvard, Vancouver, ISO, and other styles
9

Pragarauskaitė, Julija, and Gintautas Dzemyda. "Tikimybinis dažnų posekių paieškos algoritmas." Informacijos mokslai 50 (January 1, 2009): 352–57. http://dx.doi.org/10.15388/im.2009.0.3211.

Full text
Abstract:
Dažnų posekių paieška didelėse duomenų bazėse yra svarbi biologinių, klimato, fi nansinių ir daugelio kitų duomenų bazių analizei. Tikslieji algoritmai, skirti dažnų posekių paieškai, daug kartų perrenka visą duomenų bazę. Jeigu duomenų bazė didelė, tai dažnų posekių paieška yra lėta arba reikalingi superkompiuteriai. Straipsnyje pasiūlytas naujas tikimybinis dažnų posekių paieškos algoritmas, kuris analizuoja tam tikru būdu sudarytą pradinės duomenų bazės atsitiktinę imtį. Remiantis šia analizedaromos statistinės išvados apie dažnus posekius pradinėje duomenų bazėje. Šis algoritmas nėra tiksl
APA, Harvard, Vancouver, ISO, and other styles
10

Dzidolikaitė, Agnė. "GENETIC ALGORITHMS FOR MULTIDIMENSIONAL SCALING / GENETINIŲ ALGORITMŲ TAIKYMAS DAUGIAMATĖMS SKALĖMS." Mokslas – Lietuvos ateitis 7, no. 3 (2015): 275–79. http://dx.doi.org/10.3846/mla.2015.781.

Full text
Abstract:
The paper analyzes global optimization problem. In order to solve this problem multidimensional scaling algorithm is combined with genetic algorithm. Using multidimensional scaling we search for multidimensional data projections in a lower-dimensional space and try to keep dissimilarities of the set that we analyze. Using genetic algorithms we can get more than one local solution, but the whole population of optimal points. Different optimal points give different images. Looking at several multidimensional data images an expert can notice some qualities of given multidimensional data. In the p
APA, Harvard, Vancouver, ISO, and other styles
11

Kavaliauskas, Donatas, and Leonidas Sakalauskas. "Nuoseklios gamybos planavimo tvarkaraščio sudarymas." Jaunųjų mokslininkų darbai 50, no. 1 (2020): 62–69. http://dx.doi.org/10.21277/jmd.v50i1.280.

Full text
Abstract:
Gamybos projektavimo ir vadybos uždaviniuose dažnai susiduriama su įvairiomis užduočių planavimo problemomis: išteklių, žaliavų, personalo. Šios problemos yra priskiriamos NP pilnumo sudėtingumo klasei. Norint gauti optimalų sprendinį neužtenka pasinaudoti godžiaisiais algoritmais, tačiau reikia naudoti euristinės klasės algoritmus. Vienas iš euristinių algoritmų yra šakų ir ribų algoritmas. Naudojant šį algoritmą su kompiuteriu yra modeliuojamas nuoseklios gamybos planavimo uždavinio sprendimas. Taip pat straipsnyje yra pateikiami keli nuoseklios gamybos planavimo uždavinio variantai, kuriems
APA, Harvard, Vancouver, ISO, and other styles
12

Misevičius, Alfonsas, Vytautas Bukšnaitis, and Jonas Blonskis. "Euristinių algoritmų klasifikavimas." Informacijos mokslai 48 (January 1, 2009): 117–26. http://dx.doi.org/10.15388/im.2009.0.3327.

Full text
Abstract:
Straipsnis skiriamas euristinių optimizavimo algoritmų, kurie jau kelis dešimtmečius traukia kompiuterių mokslo specialistų dėmesį, klasifikavimo klausimų aptarčiai. Jame apibrėžiami euristinių algoritmų tikslai, paskirtis, jų principiniai skiriamieji faktoriai, savybės. Apžvelgiamos svarbesnių euristinių optimizavimo algoritmų (tokių kaip atkaitinimo modeliavimas, tabu paieška, genetiniai algoritmai ir pan.) klasifikavimo schemos (metodikos). Nagrinėjamas universalios algoritmų sudedamųjų komponentų matricos – substancinių konceptų sistemos – naudojimas klasifikuojant euristinius algoritmus.
APA, Harvard, Vancouver, ISO, and other styles
13

Šešok, Dmitrij, and Rimantas Belevičius. "GLOBAL OPTIMIZATION OF TRUSSES WITH A MODIFIED GENETIC ALGORITHM." JOURNAL OF CIVIL ENGINEERING AND MANAGEMENT 14, no. 3 (2008): 147–54. http://dx.doi.org/10.3846/1392-3730.2008.14.10.

Full text
Abstract:
In this paper, a technology enabling the optimization of the topology of truss or frame structures with genetic algorithms is presented. It has been shown that due to a huge number of possible variants the global solution of similar problems with exhaustive search algorithms is feasible only for systems possessing small numbers of d.o.f. s (usually until 10 nodes). These problems can be solved in a reasonable time by genetic algorithms. The modified genetic algorithm for optimization of topology of truss systems is suggested, where the repair of the genotype, instead of some constraint is used
APA, Harvard, Vancouver, ISO, and other styles
14

Baušys, Romualdas. "A NEW PREDICTOR-MULTICORRECTOR ALGORITHM FOR TIME INTEGRATION IN STRUCTURAL DYNAMICS/NAUJAS PROGNOZĖS IR MULTIKOREKCIJOS ALGORITMAS, SKIRTAS LAIKUI INTEGRUOTI STRUKTŪRINĖS DINAMIKOS UŽDAVINIUOSE." JOURNAL OF CIVIL ENGINEERING AND MANAGEMENT 6, no. 5 (2000): 345–50. http://dx.doi.org/10.3846/13921525.2000.10531612.

Full text
Abstract:
Trūkusis laike Galiorkino metodas leidžia sudaryti efektyvius struktūrinės dinamikos uždavinių sprendimo algoritmus. Šio metodo variacinė formuluotė pateikta lygtyje (3). Lygčių sistema, gauta taikant kvadratines laiko interpoliacines funkcijas, yra pateikta lygtyje (6). Taikant originalų trūkųjį laike Galiorkino metodą tenka spręsti didesnę lygčių sistemą, palyginti su įprastiniais laiko integravimo algoritmais. Norint iš vengti šio trūkumo, pasiūlytas naujas prognozės ir multikorekcijos algoritmas, skirtas laiko integravimui struktūrinės dinamikos uždaviniuose. Šio algoritmo sudarymo pagrind
APA, Harvard, Vancouver, ISO, and other styles
15

Čiegis, Raimondas, Mečislavas Meilūnas, and Artūras Štikonas. "NUMERICAL METHODS FOR A VISCOUS INCOMPRESSIBLE HEAVY LIQUID MOTION EQUATIONS/SUNKIOJO NESPŪDŽIOJO SKYSČIO TEKĖJIMO LYGČIŲ SKAITINIAI SPRENDIMO METODAI." JOURNAL OF CIVIL ENGINEERING AND MANAGEMENT 3, no. 10 (1997): 32–36. http://dx.doi.org/10.3846/13921525.1997.10531681.

Full text
Abstract:
Darbe nagrinėjamas sunkiojo nespūdžiojo skysčio tekėjimo uždavinys, kai dalis paviršiaus yra laisva. Skaitiškai sprendžiant tokius uždavinius svarbiausios dviproblemos. Pirmoji—netiesinio Navjė-Stokso uždavinio diskrečioji aproksimacija srityje su fiksuotu paviršiumi, o antroji problema—judančių paviršių skaitinis aproksimavimas. Darbe suformuluoti trys algoritmai pagrindiniam uždaviniui spręsti. Pirmajame panaudota konstruktyvi Puchnačiovo diferencialinio uždavinio sprendinio egzistencijos įrodymo schema. Šiuo metodu iteracinio proceso metu netiesinis Navjė-Stokso uždavinys sprendžiamas fiksu
APA, Harvard, Vancouver, ISO, and other styles
16

Mölders, Marc. "Auf dem Weg zum Subsumtionsautomaten?" Sociologia Internationalis: Volume 56, Issue 2 56, no. 2 (2018): 71–89. http://dx.doi.org/10.3790/sint.56.2.71.

Full text
Abstract:
Algorithmen werden in Gerichten eingesetzt, z. B. zur Rückfälligkeitsvorhersage. Dies ruft Assoziationen zum Subsumtionsautomaten des 19. Jahrhunderts hervor und fügt sich nahtlos in die Kritik des Solutionismus ein, soziale Probleme würden zunehmend technisch gelöst. Die Untersuchung von zwei vielfach verwendeten und diskutierten Beispielen (COMPAS, PSA) zeigt allerdings, dass an entscheidenden Stellen gerade nicht auf Technik gesetzt wird. Um den Algorithmus fair zu gestalten, werden nicht technische Schnittstellen, sondern Beteiligungsformate gefordert. Nicht nur hierfür, sondern an vielen
APA, Harvard, Vancouver, ISO, and other styles
17

Bintoro, Ketut Bayu Yogha, and Silvester Dian Handy Permana. "Klasifikasi Algoritma Swarm Intelligence Dalam Perspektif Complex Adaptive System dengan Metode Uji Komparasi Statistik." Jurnal Teknologi dan Sistem Komputer 5, no. 4 (2017): 166. http://dx.doi.org/10.14710/jtsiskom.5.4.2017.166-171.

Full text
Abstract:
This research aims to classify which SI algorithms have CAS or non-CAS criteria. The statistical comparative test method with 5 (five) characteristic test parameters was used as the proof approach that produces the classification. Based on the hypothesis that has been tested from 15 (fifteen) algorithms compared in this study, It was obtained that 8 of 15 (53.33%) algorithms has the majority of CAS characteristics, 3 of 15 (20%) algorithms has a minority of characteristics of CAS, and 4 out of 15 (26.66%) algorithms did not have CAS characteristics. The result can be a reference in understandi
APA, Harvard, Vancouver, ISO, and other styles
18

Eliiyi, Deniz Türsel, Aslıhan Gizem Korkmaz, and Abdullah Ercüment Çiçek. "OPERATIONAL VARIABLE JOB SCHEDULING WITH ELIGIBILITY CONSTRAINTS: A RANDOMIZED CONSTRAINT‐GRAPH‐BASED APPROACH." Technological and Economic Development of Economy 15, no. 2 (2009): 245–66. http://dx.doi.org/10.3846/1392-8619.2009.15.245-266.

Full text
Abstract:
In this study, we consider the problem of Operational Variable Job Scheduling, also referred to as parallel machine scheduling with time windows. The problem is a more general version of the Fixed Job Scheduling problem, involving a time window for each job larger than its processing time. The objective is to find the optimal subset of the jobs that can be processed. An interesting application area lies in Optimal Berth Allocation, which involves the assignment of vessels arriving at the port to appropriate berths within their time windows, while maximizing the total profit from the served ves
APA, Harvard, Vancouver, ISO, and other styles
19

Gościniak, Ireneusz, and Krzysztof Gdawiec. "Visual Analysis of Dynamics Behaviour of an Iterative Method Depending on Selected Parameters and Modifications." Entropy 22, no. 7 (2020): 734. http://dx.doi.org/10.3390/e22070734.

Full text
Abstract:
There is a huge group of algorithms described in the literature that iteratively find solutions of a given equation. Most of them require tuning. The article presents root-finding algorithms that are based on the Newton–Raphson method which iteratively finds the solutions, and require tuning. The modification of the algorithm implements the best position of particle similarly to the particle swarm optimisation algorithms. The proposed approach allows visualising the impact of the algorithm’s elements on the complex behaviour of the algorithm. Moreover, instead of the standard Picard iteration,
APA, Harvard, Vancouver, ISO, and other styles
20

Hernandez Suarez, Cesar Augusto, Juan David Flórez Charry, and David Murillo Núñez. "ESTADO DEL ARTE DE SCHEDULING ALGORITHMS (ALGORITMOS DE PROGRAMACIÓN DE ENVÍO)." Redes de Ingeniería 2, no. 1 (2011): 65. http://dx.doi.org/10.14483/2248762x.7180.

Full text
Abstract:
El presente artículo presenta un estado del arte de los llamados algoritmos de programación de envío, o en inglés “scheduling algorithms” los cuales determinan el método en que un dispositivo de red envía paquetes al medio de transmisión. Estos algoritmos son importantes para la consecución de calidad de servicio en redes convergentes y la correcta comprensión de ellos es determinante para entender los fenómenos de tráfico y cumplir los requerimientos dados en los diferentes tipos de redes (Ethernet, TDM, WiMAX, Wireless, etc).
APA, Harvard, Vancouver, ISO, and other styles
21

Rosidin, Muhamad Rosidin. "SISTEM KELAS KATA BERIMBUHANMENGGUNAKAN ALGORITMA PORTER STEMMER SEBAGAI PEMBELAJARAN BAHASA INDONESIA." Telematika 16, no. 1 (2019): 11. http://dx.doi.org/10.31315/telematika.v16i1.2988.

Full text
Abstract:
AbstractClass of word are categories of forms, meanings and functions in the Indonesian grammar system. Determining the basic words of the word affix is still difficult. The word affix class system is a solution to determine the basic words at same time with the class of words that are affixed so that they can be used as learning Indonesian language. The word affix class system was developed using the PHP programming language. Porter algorithms are algorithms that are used to change the word affix into a root word. In this study, the word affix detected by system and separated by infiltration
APA, Harvard, Vancouver, ISO, and other styles
22

De Aguilera, Miguel, Amiris Sosa, and Rocio De Aguilera. "Comunicación, discursos, algoritmos, poder." Ámbitos. Revista Internacional de Comunicación, no. 40 (2018): 161–67. http://dx.doi.org/10.12795/ambitos.2018.i40.20.

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

Costa, André Pereira da, Luciana Ferreira dos Santos, Cristiane Azevêdo dos Santos Pessoa, and Rosinalda Aurora de Melo Teles. "Abordagem de algoritmos da divisão em livros didáticos de Matemática para os anos iniciais." Educação Matemática Debate 2, no. 4 (2018): 57–80. http://dx.doi.org/10.24116/emd25266136v2n42018a03.

Full text
Abstract:
Investigamos como os algoritmos da divisão de números naturais são abordados em livros didáticos de Matemática dos anos iniciais do Ensino Fundamental; mapeamos atividades nas quais são abordados; e analisamos o uso dos algoritmos da divisão em situações de partição e quotição. Foram analisadas 104 atividades de divisão propostas em seis coleções, escolhidas aleatoriamente, aprovadas pelo PNLD de 2016. Com uma abordagem quantitativa-qualitativa, usamos como método analítico das atividades os procedimentos da análise temática. Os dados mostram que mais de 84% das atividades exploram o processo
APA, Harvard, Vancouver, ISO, and other styles
24

Agárdi, Anita. "Konstrukciós körút alapú algoritmusok használata klaszterezésre." Multidiszciplináris tudományok 11, no. 4 (2021): 127–32. http://dx.doi.org/10.35925/j.multi.2021.4.15.

Full text
Abstract:
Jelen cikk a konstrukciós algoritmusok használatát klaszterezési problémára mutatja be. A konstrukciós körút készítő algoritmusok közül a legközelebbi szomszéd algoritmust, a beszúró heurisztikákat (legközelebbi pont beszúrása, legtávolabbi pont beszúrása, legolcsóbb beszúrás, véletlen pont beszúrása), és a greedy algoritmus lett tesztelve. A módosított algoritmusok lényege, hogy nem kell megadni a klaszterszámot, azt maga az algoritmus alakítja ki.
APA, Harvard, Vancouver, ISO, and other styles
25

Mahmudin, M. Zainal, Altien Rindengan, and Winsy Weku. "Penggunaan Association Rule Data Mining Untuk Menentukan Pola Lama Studi Mahasiswa F-MIPA UNSRAT." d'CARTESIAN 3, no. 1 (2014): 1. http://dx.doi.org/10.35799/dc.3.1.2014.3777.

Full text
Abstract:
Abstract The requirement of highest information sometimes is not balance with the provision of adequate information, so that the information must be re-excavated in large data. By using the technique of association rule we can obtain information from large data such as the college data. The purposes of this research is to determine the patterns of study from student in F-MIPA UNSRAT by using association rule method of data mining algorithms and to compare in the apriori method and a hash-based algorithms. The major’s student data of F-MIPA UNSRAT as a data were processed by association rule me
APA, Harvard, Vancouver, ISO, and other styles
26

Borcovas, Evaldas, and Gintautas Daunys. "CPU AND GPU (CUDA) TEMPLATE MATCHING COMPARISON / CPU IR GPU (CUDA) PALYGINIMAS VYKDANT ŠABLONŲ ATITIKTIES ALGORITMĄ." Mokslas – Lietuvos ateitis 6, no. 2 (2014): 129–33. http://dx.doi.org/10.3846/mla.2014.16.

Full text
Abstract:
Image processing, computer vision or other complicated opticalinformation processing algorithms require large resources. It isoften desired to execute algorithms in real time. It is hard tofulfill such requirements with single CPU processor. NVidiaproposed CUDA technology enables programmer to use theGPU resources in the computer. Current research was madewith Intel Pentium Dual-Core T4500 2.3 GHz processor with4 GB RAM DDR3 (CPU I), NVidia GeForce GT320M CUDAcompliable graphics card (GPU I) and Intel Core I5-2500K3.3 GHz processor with 4 GB RAM DDR3 (CPU II), NVidiaGeForce GTX 560 CUDA compat
APA, Harvard, Vancouver, ISO, and other styles
27

Kiela, Karolis, and Romualdas Navickas. "AUTOMATED INTEGRATED ANALOG FILTER DESIGN ISSUES / AUTOMATIZUOTOJO INTEGRINIŲ ANALOGINIŲ FILTRŲ PROJEKTAVIMO YPATUMAI." Mokslas – Lietuvos ateitis 7, no. 3 (2015): 323–29. http://dx.doi.org/10.3846/mla.2015.793.

Full text
Abstract:
An analysis of modern automated integrated analog circuits design methods and their use in integrated filter design is done. Current modern analog circuits automated tools are based on optimization algorithms and/or new circuit generation methods. Most automated integrated filter design methods are only suited to gmC and switched current filter topologies. Here, an algorithm for an active RC integrated filter design is proposed, that can be used in automated filter designs. The algorithm is tested by designing an integrated active RC filter in a 65 nm CMOS technology. Atlikta naujausių integri
APA, Harvard, Vancouver, ISO, and other styles
28

Mazanec, Radim, Lívie Mensová, Daniel Baumgartner, Veronika Potočková, and Josef Zámečník. "Diagnostics algorithm of muscular dystrophies." Neurologie pro praxi 20, no. 3 (2019): 190–94. http://dx.doi.org/10.36290/neu.2019.017.

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

Camilo Júnior, Celso G., and Keiji Yamanaka. "Algoritmo Auxiliar Paralelo para Melhorar a Performance dos Algoritmos Genéticos com Codificação Binária." Learning and Nonlinear Models 6, no. 2 (2008): 121–41. http://dx.doi.org/10.21528/lnlm-vol6-no2-art3.

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

Handa, Hisashi. "Solving Constraint Satisfaction Problems by Memetic Algorithms Using Estimation of Distribution Algorithms." Transactions of the Japanese Society for Artificial Intelligence 19 (2004): 405–12. http://dx.doi.org/10.1527/tjsai.19.405.

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

Almazroa, Ahmed, Sami Alodhayb, Kaamran Raahemifar, and Vasudevan Lakshminarayanan. "An Automatic Image Processing System for Glaucoma Screening." International Journal of Biomedical Imaging 2017 (2017): 1–19. http://dx.doi.org/10.1155/2017/4826385.

Full text
Abstract:
Horizontal and vertical cup to disc ratios are the most crucial parameters used clinically to detect glaucoma or monitor its progress and are manually evaluated from retinal fundus images of the optic nerve head. Due to the rarity of the glaucoma experts as well as the increasing in glaucoma’s population, an automatically calculated horizontal and vertical cup to disc ratios (HCDR and VCDR, resp.) can be useful for glaucoma screening. We report on two algorithms to calculate the HCDR and VCDR. In the algorithms, level set and inpainting techniques were developed for segmenting the disc, while
APA, Harvard, Vancouver, ISO, and other styles
32

RICHARDS, DANA, and JEFFREY S. SALOWE. "MIXED SPANNING TREES IN THEORY AND PRACTICE." International Journal of Computational Geometry & Applications 09, no. 03 (1999): 277–92. http://dx.doi.org/10.1142/s0218195999000194.

Full text
Abstract:
A mixed spanning tree is a tree that seeks to combine the properties of a minimim weight spanning tree and shortest path tree. We concentrate on the problem for complete Euclidean graphs. A survey of prior algorithms is given and several new algorithms are proposed. New analyses of some known algorithms are provided. All the algorithms are compared empirically and it is shown that the algorithms with the best known performance bounds, perform the worst in practice. Evidence is given to support the hypothesis that the performance depends on the algorithm's use of long edges.
APA, Harvard, Vancouver, ISO, and other styles
33

Atmaja, Eduardus Hardika Sandy, and Kartono Pinaryanto. "Unjuk Kerja Selection Sort Hybrid." Jurnal Buana Informatika 11, no. 1 (2020): 17. http://dx.doi.org/10.24002/jbi.v11i1.2699.

Full text
Abstract:
Abstract. Sorting is the most basic and important process in data processing. The sorting process on large data causes large computation. Some existing sorting algorithms need to be improved to further improve their performance. This study tried to develop an existing selection sort algorithm, into a selection sort hybrid algorithm that is expected to have better performance. Selection sort hybrid algorithm is an algorithm that combines both minimum and maximum searching techniques. It can find minimum and maximum values in the same time to sort from the both side of the data. Since it can be
APA, Harvard, Vancouver, ISO, and other styles
34

Sutradana, Gathut Cakra, and M. Didik Rohmad Wahyudi. "PENERAPAN DATA MINING UNTUK ANALISIS PENGARUH LAMA STUDI MAHASISWA TEKNIK INFORMATIKA UIN SUNAN KALIJAGA YOGYAKARTA MENGGUNAKAN METODE APRIORI." JISKA (Jurnal Informatika Sunan Kalijaga) 1, no. 3 (2017): 153. http://dx.doi.org/10.14421/jiska.2017.13-07.

Full text
Abstract:
ABSTRACTThe accuracy of a long study of college students at a university becomes very important in demonstrating the quality of the learning process in college. There are many things that affect a student's study time. Data Mining offers a way to know the various aspects that may affect a student's study time. To know the various aspects that influence the duration of the study based on data graduation students are available, then the implementation of a Data Mining algorithms can be used. In this study, Data Mining algorithms used to find aspects that affect student study duration is Apriori
APA, Harvard, Vancouver, ISO, and other styles
35

Effendi, Yutika Amelia, and Riyanarto Sarno. "PARALLEL PROCESS DISCOVERY USING A NEW TIME-BASED ALPHA++ MINER." IIUM Engineering Journal 21, no. 1 (2020): 126–41. http://dx.doi.org/10.31436/iiumej.v21i1.1173.

Full text
Abstract:
A lot of services in business processes lead information systems to build huge amounts of event logs that are difficult to observe. The event log will be analysed using a process discovery technique to mine the process model by implementing some well-known algorithms such as deterministic algorithms and heuristic algorithms. All of the algorithms have their own benefits and limitations in analysing and discovering the event log into process models. This research proposed a new Time-based Alpha++ Miner with an improvement of the Alpha++ Miner and Modified Time-based Alpha Miner algorithm. The p
APA, Harvard, Vancouver, ISO, and other styles
36

Wadisman, Cendra, Irohito Nozomi, and Sri Rahmawati. "PENGAMANAN DATABASE MENGGUNAKAN KOMBINASI ALGORITMA (CEST CRYPTOGRAPHY) DAN ALGORiTMA BASE64." JURTEKSI (Jurnal Teknologi dan Sistem Informasi) 7, no. 1 (2020): 33–38. http://dx.doi.org/10.33330/jurteksi.v7i1.896.

Full text
Abstract:
Abstract: Combined algorithm (Cest Cryptography) is a combination of 3 algorithms such as Merklee-Hellman, Discrete Logarithm and ASCII Modification, using Base64 to hide 2 public keys and 2 private keys. Combination algorithms are used because of the increasing number of techniques in cryptography, making it easier to combine each other algorithms in order to get more complicated encryption that won't even be cracked in the near future. On large sites there has been database theft, if the stolen database has been encrypted it will be difficult for data thieves to take advantage of it, but if
APA, Harvard, Vancouver, ISO, and other styles
37

Meza Álvarez, Joaquín Javier, Juan Manuel Cueva Lovelle, and Helbert Eduardo Espitia. "REVISIÓN SOBRE ALGORITMOS DE OPTIMIZACIÓN MULTI-OBJETIVO GENÉTICOS Y BASADOS EN ENJAMBRES DE PARTÍCULAS." Redes de Ingeniería 6, no. 2 (2016): 54. http://dx.doi.org/10.14483/udistrital.jour.redes.2015.2.a06.

Full text
Abstract:
El enfoque evolutivo como también el comportamiento social han mostrado ser una muy buena alternativa en los problemas de optimización donde se presentan varios objetivos a optimizar. De la misma forma, existen todavía diferentes vias para el desarrollo de este tipo de algoritmos. Con el fin de tener un buen panorama sobre las posibles mejoras que se pueden lograr en los algoritmos de optimización bio-inspirados multi-objetivo es necesario establecer un buen referente de los diferentes enfoques y desarrollos que se han realizado hasta el momento.En este documento se revisan los algoritmos de o
APA, Harvard, Vancouver, ISO, and other styles
38

Jian, X., X. Xiao, H. Chengfang, Z. Zhizhong, W. Zhaohui, and Z. Dengzhong. "A HADOOP-BASED ALGORITHM OF GENERATING DEM GRID FROM POINT CLOUD DATA." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XL-7/W3 (April 30, 2015): 1209–14. http://dx.doi.org/10.5194/isprsarchives-xl-7-w3-1209-2015.

Full text
Abstract:
Airborne LiDAR technology has proven to be the most powerful tools to obtain high-density, high-accuracy and significantly detailed surface information of terrain and surface objects within a short time, and from which the Digital Elevation Model of high quality can be extracted. Point cloud data generated from the pre-processed data should be classified by segmentation algorithms, so as to differ the terrain points from disorganized points, then followed by a procedure of interpolating the selected points to turn points into DEM data. The whole procedure takes a long time and huge computing r
APA, Harvard, Vancouver, ISO, and other styles
39

Čiegis, R., A. Jakušev, A. Krylovas, and O. Suboč. "PARALLEL ALGORITHMS FOR SOLUTION OF NONLINEAR DIFFUSION PROBLEMS IN IMAGE SMOOTHING." Mathematical Modelling and Analysis 10, no. 2 (2005): 155–72. http://dx.doi.org/10.3846/13926292.2005.9637279.

Full text
Abstract:
In this work we consider parallel algorithms for solution of nonlinear parabolic PDEs. First mathematical models describing nonlinear diffusion filters are presented. The finite‐volume method is used to approximate differential equations. Parallel algorithms are based on the domain decomposition method. The algorithms are implemented by using ParSol parallelization tool and a brief description of this tool is also presented. The efficiency of proposed parallel algorithms is investigated and results of the scalability analysis are given. Theoretical predictions are compared with results of comp
APA, Harvard, Vancouver, ISO, and other styles
40

Várkonyi, Viktória. "The know how of STDs diagnostics." Bőrgyógyászati és Venerológiai Szemle 95, no. 4 (2019): 156–63. http://dx.doi.org/10.7188/bvsz.2019.95.4.1.

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

Zyka, Vit. "Používáme pdfTeX IVa: hz-algoritmus jednodušeji." Zpravodaj Československého sdružení uživatelů TeXu 15, no. 1 (2005): 90–92. http://dx.doi.org/10.5300/2005-1/90.

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

Pikutis, Modestas. "ARTIFICIAL NEURAL NETWORK IN MAXIMUM POWER POINT TRACKING ALGORITHM OF PHOTOVOLTAIC SYSTEMS / DIRBTINIŲ NEURONŲ TINKLO TAIKYMAS DIDŽIAUSIOS GALIOS TAŠKO SAULĖS ELEMENTUOSE SEKIMO ALGORITME." Mokslas – Lietuvos ateitis 6, no. 2 (2014): 182–87. http://dx.doi.org/10.3846/mla.2014.26.

Full text
Abstract:
Scientists are looking for ways to improve the efficiency of solar cells all the time. The efficiency of solar cells which are available to the general public is up to 20%. Part of the solar energy is unused and a capacity of solar power plant is significantly reduced – if slow controller or controller which cannot stay at maximum power point of solar modules is used. Various algorithms of maximum power point tracking were created, but mostly algorithms are slow or make mistakes. In the literature more and more oftenartificial neural networks (ANN) in maximum power point tracking process are m
APA, Harvard, Vancouver, ISO, and other styles
43

Kartasasmita, Masdui, Arif Budimansyah Purba, and Wawan Kusdiawan. "PENENTUAN JARAK EFISIEN PENGANTARAN PASIEN OLEH AMBULANCE KE RSUD KARAWANG DENGAN ALGORITME DIJKSTRA." ILKOM Jurnal Ilmiah 9, no. 3 (2017): 290–300. http://dx.doi.org/10.33096/ilkom.v9i3.159.290-300.

Full text
Abstract:
Banyak jalan yang menghubungkan dari berbagai puskemas yang ada di Karawang menuju ke RSUD Karawang dengan jarak tempuh yang berbeda-beda. Penelitian ini bertujuan untuk memberikan solusi kepada pihak ambulance untuk menentukan rute dalam pengantaran pasien ke RSUD Karawang dengan menggunakan algoritma Dijkstra. Algoritma ini digunakan dalam pencarian rute terpendek yang diharapkan dapat menjadi rute terefisien untuk mencapai tujuan dari lokasi yang diinginkan. Algoritma Dijkstra adalah sebuah algoritma rakus (greedy algorithm) yang dipakai dalam memecahkan permasalahan jarak terpendek (shorte
APA, Harvard, Vancouver, ISO, and other styles
44

Agapie, Alexandru. "Theoretical Analysis of Mutation-Adaptive Evolutionary Algorithms." Evolutionary Computation 9, no. 2 (2001): 127–46. http://dx.doi.org/10.1162/106365601750190370.

Full text
Abstract:
Adaptive evolutionary algorithms require a more sophisticated modeling than their static-parameter counterparts. Taking into account the current population is not enough when implementing parameter-adaptation rules based on success rates (evolution strategies) or on premature convergence (genetic algorithms). Instead of Markov chains, we use random systems with complete connections - accounting for a complete, rather than recent, history of the algorithm's evolution. Under the new paradigm, we analyze the convergence of several mutation-adaptive algorithms: a binary genetic algorithm, the 1/5
APA, Harvard, Vancouver, ISO, and other styles
45

Singh, Amrit Pal, Chetna Gupta, Rashpal Singh, and Nandini Singh. "A Comparative Analysis of Evolutionary Algorithms for Data Classification Using KEEL Tool." International Journal of Swarm Intelligence Research 12, no. 1 (2021): 17–28. http://dx.doi.org/10.4018/ijsir.2021010102.

Full text
Abstract:
Evolutionary algorithms are inspired by the biological model of evolution and natural selection and are used to solve computationally hard problems, also known as NP-hard problems. The main motive to use these algorithms is their robust and adaptive nature to provide best search techniques for complex problems. This paper presents a comparative analysis of classification of algorithm's family instead of algorithms comparison using KEEL tool. This work compares SSMA-C, DROP3PSO-C, FURIA-C, GFS-MaxLogitBoost-Cand CPSO-C algorithms. Further, these selected evolutionary algorithms are compared aga
APA, Harvard, Vancouver, ISO, and other styles
46

Michael, James Bret, and Jeffrey Voas. "Algorithms, Algorithms, Algorithms." Computer 53, no. 11 (2020): 13–15. http://dx.doi.org/10.1109/mc.2020.3016534.

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

Rodríguez-Padilla, Á. "Diagnostic and therapeutic algorithms for hepatobiliar surgery." ACTUALIDAD MEDICA 103, no. 804 (2018): 104. http://dx.doi.org/10.15568/am.2018.804.cl01.

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

Castelo, Noah, Maarten W. Bos, and Donald Lehmann. "Let the Machine Decide: When Consumers Trust or Distrust Algorithms." NIM Marketing Intelligence Review 11, no. 2 (2019): 24–29. http://dx.doi.org/10.2478/nimmir-2019-0012.

Full text
Abstract:
AbstractThanks to the rapid progress in the field of artificial intelligence algorithms are able to accomplish an increasingly comprehensive list of tasks, and often they achieve better results than human experts. Nevertheless, many consumers have ambivalent feelings towards algorithms and tend to trust humans more than they trust machines. Especially when tasks are perceived as subjective, consumers often assume that algorithms will be less effective, even if this belief is getting more and more inaccurate.To encourage algorithm adoption, managers should provide empirical evidence of the algo
APA, Harvard, Vancouver, ISO, and other styles
49

Tepecik, Abdülkadir, Abidin Doğan, Melike Sardoğan, and Müfit Çetin. "Comparative examination of RSA and SEA algorithms for computer engineering education." International Journal of Innovative Research in Education 4, no. 3 (2017): 135. http://dx.doi.org/10.18844/ijire.v4i3.2551.

Full text
Abstract:
Teknolojinin hızla geliştiği bu dönemde kritik öneme sahip belgeler ve kişilik bilgileri dijital ortamlarda saklanmaya başlanmıştır. Saklanan bilgilerin öneminin artması onlar için uygulanan güvenlik prosedürlerinin de gelişmesine yol açmış ve yeni şifreleme algoritmalarının türemesine sebep olmuştur.Bu makalede yakın dönemde ortaya çıkan ve çoğunlukla gömülü sistemlerde kullanılan SEA (Sclable Encrytion Algoritm) algoritması ile RSA algoritması karşılaştırılmıştır.
 Anahtar Kelimeler: RSA , SEA , algoritma analizi, performans hesaplama, büyük-o.
APA, Harvard, Vancouver, ISO, and other styles
50

Storchak, M., and F. Diemer. "Simulation des orthogonalen Zerspanens mit LS-Dyna*/Simulation of the orthogonal cutting process with LS-Dyna - Comparison of Lagrangian-, Eulerian- and SPH cutting models." wt Werkstattstechnik online 107, no. 01-02 (2017): 34–38. http://dx.doi.org/10.37544/1436-4980-2017-01-02-36.

Full text
Abstract:
Immer häufiger kommen Simulationsergebnisse zur Optimierung von Zerspanprozessen zum Einsatz. Dabei wird ein sehr breites Spektrum verschiedener Techniken und Algorithmen verwendet. Für die entsprechende Auswahl muss der Anwendungsingenieur eine Überprüfung der Vor- und Nachteile der verschiedenen Algorithmen bei der Erstellung und Verwendung der numerischen Zerspanmodelle in Bezug auf den jeweils vorliegenden Zerpanprozess vornehmen. In diesem Artikel werden unterschiedliche Berechnungs- und Ansatzalgorithmen anhand von vier Zerspanmodellen – Lagrange‘sches Modell mit und ohne Remeshing, Eule
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!