Bibliographies thématiques / Algortimi

Sommaire

Articles de revues
Thèses
Livres
Chapitres de livres
Actes de conférences

Littérature scientifique sur le sujet « Algortimi »

Auteur : Grafiati

Publié le 9 mars 2023

Mis à jour le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Algortimi ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Algortimi"

Zhou, Shi Bo, et Wei Xiang Xu. « Local Outlier Detection Algorithm Based on Coefficient of Variation ». Applied Mechanics and Materials 635-637 (septembre 2014) : 1723–28. http://dx.doi.org/10.4028/www.scientific.net/amm.635-637.1723.

Texte intégral

Résumé :

Local outliers detection is an important issue in data mining. By analyzing the limitations of the existing outlier detection algorthms, a local outlier detection algorthm based on coefficient of variation is introduced. This algorthms applies K-means which is strong in outliers searching, divides data set into sections, puts outliers and their nearing clusters into a local neighbourhood, then figures out the local deviation factor of each local neighbourhood by coefficient of variation, as a result, local outliers can more likely be found.The heoretic analysis and experimental results indicate that the method is ef fective and efficient.

Styles APA, Harvard, Vancouver, ISO, etc.

DePano, N. Adlai A., Farinaz D. Boudreaux, Philip Katner et Brian Li. « Algorthmic pradigms ». ACM SIGCSE Bulletin 22, n^o 1 (février 1990) : 186–91. http://dx.doi.org/10.1145/319059.323448.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Gupta, Sandeep, et A. K. Sharma. « STATCOM �Its Control Algorthim ». i-manager's Journal on Electrical Engineering 3, n^o 4 (15 juin 2010) : 41–45. http://dx.doi.org/10.26634/jee.3.4.1189.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Sianturi, Fricles Ariwisanto, Mina Kumari et Erlina Laian. « Implementasi Algortima C4.5 Menentukan Pola Berangkatan Jamaah Haji ». Jurnal Sains dan Teknologi 3, n^o 2 (1 mars 2022) : 66–70. http://dx.doi.org/10.55338/saintek.v3i2.260.

Texte intégral

Résumé :

Determination of the Hajj Pilgrim Departure Pattern is currently very much needed by the Haj organizers, especially at the Office of the Ministry of Religion Lubuk Pakam because the schedule of pilgrims' departure is still not regular, causing accumulation of data on pilgrims who will be departed to the holy land, but with The number of pilgrims who will depart for the pilgrimage is made to determine the pattern of Hajj departure with the C4.5 Algorithm to make it easier for the hajj organizer staff to determine what age should be sent to the holy land.

Styles APA, Harvard, Vancouver, ISO, etc.

Kartiko, Abi Prima Yudha, Nanda Dimas Aryanto et Mahatamtama Arya Farabi. « Klasifikasi Sampah di Saluran Air Menggunakan Algortima CNN ». Indonesian Journal of Data and Science 3, n^o 2 (31 juillet 2022) : 72–81. http://dx.doi.org/10.56705/ijodas.v3i2.33.

Texte intégral

Résumé :

Tingginya populasi manusia turut menyumbangkan peningkatan jumlah sampah, sehingga dibutuhkan sebuah sistem yang membantu manusia mengklasifikasikan sampah. Perkembangan teknologi yang dirasakan hampir di semua aspek kehidupan termasuk pada pengembangan lingkungan. Dengan teknologi yang ada diharapkan bisa membantu meringankan tugas manusia dan meningkatkan efektifitas penggunaan waktu. Convolutional Neural Network (CNN) merupakan sebuah sistem pengolahan objek dengan pengenalan citra. Dan dengan menggunakan teknik CNN atau Convolutional Neural Network yang banyak digunakan untuk mengenali suatu objek dan diharapkan dapat mempermudah kerja manusia serta menghemat waktu yang digunakan.

Styles APA, Harvard, Vancouver, ISO, etc.

Pambudi, Arif Prio, Ari Waluyo et El Vionna Laellyn Nurul Fatich. « Perancangan Sistem Penjadwalan Perkuliahan Berbasis Website Menggunakan Algortima Genetika ». JATISI (Jurnal Teknik Informatika dan Sistem Informasi) 8, n^o 3 (14 septembre 2021) : 1133–46. http://dx.doi.org/10.35957/jatisi.v8i3.1051.

Texte intégral

Résumé :

Perkembangan teknologi informasi telah berkembang sangat pesat dan memberi dampak positif bagi kegiatan manusia. Salah satu hasil perkembangan teknologi informasi adalah terciptanya kecerdasan buatan (Artificial Intelligence) yang mampu membantu memecahkan suatu masalah yang rumit, bahkan terkadang lebih cepat dan lebih andal dibandingkan dengan pemecahan masalah oleh manusia sendiri. Berbagai macam jenis kecerdasan buatan telah dikembangkan saat ini, algoritma genetika adalah salah satunya. Algoritma genetika merupakan metode heuristik kecerdasan buatan yang dapat membantu memecahkan masalah penjadwalan perkuliahan dengan harapan proses penjadwalan perkuliahan dapat dilakukan secara akurat, cepat, efisien, dan efektif. Pada Politeknik Dharma Partria Kebumen, proses penjadwalan perkuliahan dilakukan secara komputerisasi dengan aplikasi Microsoft Excel. Hal ini dinilai kurang efektif karena dibutuhkan tingkat ketelitian yang tinggi supaya tidak terjadi bentrok dalam jadwal perkuliahan, serta proses yang panjang, kurang sederhana, dan waktu yang lama. Berdasarkan masalah tersebut, dibutuhkan sebuah sistem penjadwalan perkuliahan yang memanfaatkan algoritma genetika sebagai metode otomasi. Metode pengembangan sistem pada penelitian ini ialah metode konvensional, waterfall, dengan permodelan sistem Undifinied Modeling Languade (UML). Berdasarkan hasil uji coba sistem penjadwalan, didapatkan waktu paling efektif untuk proses penjadwalan perkuliahan adalah 00:12:17 pada nilai populasi 10, Pm 0,4, dan Pc 0,7. Setelah dirancanganya sistem informasi penjadwalan perkuliahan berbasis website menggunakan algoritma gentika, proses penjadwalan perkuliahan pada setiap awal semester dapat dilakukan dengan akurat, cepat, efisien, dan efektif.

Styles APA, Harvard, Vancouver, ISO, etc.

Adri, Didin. « OPTIMASI FUNGSI NONLINEAR TIGA VARIABLE MENGGUNAKAN ALGORITMA GENETIKA ». MAp (Mathematics and Applications) Journal 3, n^o 1 (30 juin 2021) : 28–34. http://dx.doi.org/10.15548/map.v3i1.2298.

Texte intégral

Résumé :

Pada penelitian ini akan ditentukan nilai minimum dari tiga buah fungsi yang berbeda menggunakan algortima genetika. Pengkodean algortima genetika pada penelitian ini menggunakan binary encoding. Metode crossover yang dipilih adalah uniform crossover dengan menggunakan parameter Jumlah Maksimum generasi (mIt) = 100; Jumlah Populasi (nPop) = 100; Probabilitas Crossover (pCro) = 0,01; Probabilitas Mutasi (pMut) = 0,02. Kemudian Program dijalankan sebanyak 20 kali untuk melihat konsistensi nilai yang dihasilkan dari kode program yang dibuat, kemudian diperoleh hasil sebagai berikut : Nilai minimum untuk fungsi pertama adalah 1,0000, nilai minimum dari fungsi kedua adalah 0 dan nilai minimum dari fungsi ketiga adalah 49,0000

Styles APA, Harvard, Vancouver, ISO, etc.

Ivanov, Dmitry A., Joachim Käschel et Boris V. Sokolov. « COMBINED ALGORTIHMS FOR COLLABORATIVE NETWORKS ADAPTATION ». IFAC Proceedings Volumes 40, n^o 18 (septembre 2007) : 579–84. http://dx.doi.org/10.3182/20070927-4-ro-3905.00096.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Kattimani, Sourabh. « Water Demand Prediction using KNN Algorthim ». International Journal for Research in Applied Science and Engineering Technology 10, n^o 6 (30 juin 2022) : 4705–14. http://dx.doi.org/10.22214/ijraset.2022.45010.

Texte intégral

Résumé :

Abstract: Many factors influence irrigation water requirement in an agriculture field. those factors are age of plant, type of soil, temperature, level of sunlight, water needed. Many factors influence irrigation water requirement in an agriculture field. those factors are age of plant, type of soil, temperature, level of sunlight, water needed. Despite the multiple solution proposed, still the quantity of water overflood and underfloor in the agriculture felid. The artificial influence on irrigation requirement should be thought of an important impact factor, considering the requirement of water, the technology can help in preserving large quantity of water in agriculture felid. development of complex and elaborate forecasting methods such as artificial neural network (ANN)can be costly to develop and implement with the limited recourses available The balance between water supply and demand requires efficient water supply system management techniques. This Despite the multiple solution proposed, still the quantity of water overflood and underfloor in the agriculture felid. The artificial influence on irrigation requirement should be thought of an important impact factor, considering the requirement of water, the technology can help in preserving large quantity of water in agriculture felid. development of complex and elaborate forecasting methods such as artificial neural network (ANN)canbe costly to develop and implement with the limited recourses available

Styles APA, Harvard, Vancouver, ISO, etc.

Karyadiputra, Erfan, et Agus Setiawan. « PENERAPAN DATA MINING UNTUK PREDIKSI AWAL KEMUNGKINAN TERINDIKASI DIABETES ». Teknosains : Media Informasi Sains dan Teknologi 16, n^o 2 (23 août 2022) : 221–32. http://dx.doi.org/10.24252/teknosains.v16i2.28257.

Texte intégral

Résumé :

Diabetes merupakan salah satu penyakit kronis yang memiliki ciri khas berupa tingginya kadar gula (glukosa) darah. Glukosa adalah sumber energi paling utama bagi sel-sel tubuh manusia, namun glukosa yang tertumpuk di dalam darah dapat mengakibatkan berbagai gangguan pada organ tubuh jika tidak dikontrol dan menimbulkan berbagai komplikasi penyakit lain yang dapat membahayakan penderitanya. Deteksi dini diabetes diperlukan karena adanya fase asimtomatik yang cukup lama, fase asimtomatik adalah kondisi penyakit yang sudah positif diderita tetapi tidak menimbulkan gejala klinis pada penderita. Tujuan penelitian ini adalah untuk memprediksi kemungkinan awal seseorang terindikasi penyakit diabetes berdasarkan dataset diabetes menggunakan teknik data mining yaitu metode algoritma Decision Tree C4.5, Naive Bayes dan K-Nearest Neighbors. Hasil pengujian Cross Validation dari ketiga algortima kemudian dibandingkan dengan pengukuran performance menggunakan Confusion Matrix, Compare ROC dan Paired T-Test sehingga didapatkan metode algortima terbaik. Adapun hasil dari penelitian ini menunjukkan bahwa algoritma Decision Tree C4.5 menjadi algoritma terbaik berdasarkan hasil performance akurasi prediksi sebesar 96,35% dengan nilai AUC sebesar 0,949 sehingga termasuk ke dalam kategori excellent classification serta hasil uji beda T-Test yang dominan jika dibandingkan dengan algoritma lainnya. Oleh sebab itu algortima Decision Tree C4.5 lebih akurat dalam memprediksi awal kemungkinan seseorang terindikasi penyakit diabetes.

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Thèses sur le sujet "Algortimi"

Scandellari, Carolina. « Algortimi di spike detection per applicazioni neuroprotesiche : sviluppo di modelli, implementazione e valutazione delle performance ». Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/19904/.

Texte intégral

Résumé :

I disordini neurologici costituiscono il 6,3% delle cause di malattia in tutto il mondo, diventando una delle priorità della sanità globale. Per trattare questi disordini si utilizzano farmaci, ma alcuni pazienti possono risultarne resistenti. La Neuroingegneria propone soluzioni innovative per la cura e la riabilitazione di queste patologie, proponendo, tra le varie soluzioni, le neuroprotesi, capaci di sostituire un’area danneggiata del cervello o di ricollegare artificialmente due aree disconnesse bypassando la lesione che ha causato il danno. Tra questi, il dispositivo sviluppato presso la University of Kansas (KUMC) si è dimostrato essere efficace in esperimenti effettuati su topi con lesione focale in area motoria. Il funzionamento di questo dispositivo è basato sull’impianto di micro-elettrodi in due regioni cerebrali disconnesse a causa di una lesione. Questi creano un ponte in grado di ricollegare le due aree scollegate attraverso la registrazione di eventi (spike) in una delle due aree, e la seguente somministrazione di corrente nella seconda. In questo tipo di dispositivi, è importantissimo effettuare una identificazione corretta degli spikes. Il mio lavoro di tesi si inserisce nell’ambito della collaborazione tra il Rehab Technologies Lab (IIT, Genova), dove ho svolto il tirocinio, e la KUMC in relazione al progetto per lo sviluppo di neuroprotesi innovative per il recupero motorio a seguito di danni cerebrali. Nello specifico, il mio lavoro di Tesi si concentra sulla Spike Detection (SD), di cui uno dei problemi fondamentali è la mancanza di un ground truth, ovvero di una conoscenza a priori della localizzazione degli spikes nel tracciato. Nel contesto descritto sopra, si inseriscono gli obiettivi di questa Tesi: fornire un ground truth, studiare e adattare un set di algoritmi di SD già presenti in letteratura, modificare un algoritmo ad alte prestazioni sviluppato all’interno di IIT in passato e confrontare le prestazioni di tutti gli algoritmi di SD.

Styles APA, Harvard, Vancouver, ISO, etc.

CICCOLELLA, SIMONE. « Practical algorithms for Computational Phylogenetics ». Doctoral thesis, Università degli Studi di Milano-Bicocca, 2022. http://hdl.handle.net/10281/364980.

Texte intégral

Résumé :

In questo manoscritto vengono discussi le principali sfide computazionali nel campo della inferenza di filogenesi tumorale a vengono proposte diverse soluzione per i tre principali problemi di (i) ricostruzione dell'evoluzioni di un campione tumorale, (ii) clustering di dati SCS per una piu' pulita e veloce inferenza e (iii) il confronto di diverse filogenesi. Inoltre viene discusso come combinare le diverse soluzioni in una singola pipeline per una piu' rapida analisi.
In this manuscript we described the main computational challenges of the cancer phylogenetic field and we proposed different solutions for the three main problems of (i) the progression reconstruction of a tumor sample, (ii) the clustering of SCS data to allow for a cleaner and faster inference and (iii) the evaluation of different phylogenies. Furthermore we combined them into a usable pipeline to allow for a faster analysis.

Styles APA, Harvard, Vancouver, ISO, etc.

Šarda, Petr. « Algortimy pro sestavování puzzle ». Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-219709.

Texte intégral

Résumé :

This diploma thesis deals with constructing of algorithms of consisting a puzzle and suggesting of the workplace for its imaging. There are studied two methods of forming a puzlle. First method is forming of the puzzle with a known pattern. For this method is used the Harris operator and the correlation. In the second method is the puzzle formed without a pattern. Fot this method is used the correlation. In the last part there is a mutual evaluation of these two methods.

Styles APA, Harvard, Vancouver, ISO, etc.

Muller, Andreas. « Message passing algorthms in wireless communications ». Thesis, University of Bristol, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.544340.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Tabatabaian, Seyed Jalil. « Cryptanalysis algortihms for public key cryptosystems ». Thesis, University of Newcastle Upon Tyne, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.283904.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Bangert, Patrick David. « Algorthmic problems in the braid groups ». Thesis, University College London (University of London), 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.417929.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Yuret, Deniz. « From genetic algorthms to efficient optimization ». Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/37727.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Vahl, Christopher Irvin. « Algortihms for constructing D-optimal designs for multilevel experiments / ». Search for this dissertation online, 2005. http://wwwlib.umi.com/cr/ksu/main.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Newman, Aaron R. (Aaron Roy). « An improved scheduling algorthim for space-based surveillance sensors ». Thesis, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/49588.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Yeung, Chun. « A PERFORMANCE COMPARISON OF CLUSTERING ALGORITHMS IN AD HOCNETWORKS ». Master's thesis, University of Central Florida, 2006. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2393.

Texte intégral

Résumé :

An ad hoc network is comprised of wireless mobile nodes without the need of wired network infrastructure. Due to the limited transmission range of nodes, the exchange of data between them may not be possible using direct communication. Partitioning the network into clusters and electing a clusterhead for each cluster to assist with the resource allocation and data packet transmissions among its members and neighboring clusterheads is one of the most common ways of providing support for the existing ad hoc routing protocols. This thesis presents the performance comparison of four ad hoc network clustering protocols: Dynamic Mobile Adaptive Clustering (DMAC), Highest-Degree and Lowest-ID algorithms, and Weighted Clustering Algorithm (WCA). Yet Another Extensible Simulation (YAES) was used as the simulator to carry out the simulations.
M.S.Cp.E.
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Computer Engineering

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Livres sur le sujet "Algortimi"

United States. National Aeronautics and Space Administration., dir. Final report to the National Aeronautics and Space Agency for Power spectral estimation algorthms [i.e. algorithms] : (contract no. NAG-5-499). Bowie, Md : Bowie State University, 1990.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Stross, Charles. Antibodies. AudioText, 2005.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

millonarioemprendedor, Daniel Martinez. Guia Completa para Instagram Marketing : 5 Pasos para Crear Tu Perfil de Instagram y Consejos para Romper el Algortimo. Independently Published, 2020.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Goodrich. Website to Accompany Data Structures & Algortihms in Java 3e (Http://datastructures.net) Solns, Slides, Add'l Problems, Applets + More. John Wiley & Sons Inc, 2004.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Algortimi"

Gabr, B., et M. Ahmed. « Assessment of Genetic Algorthim in Developing Bathymetry Using Multispectral Landsat Images ». Dans APAC 2019, 393–400. Singapore : Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-15-0291-0_55.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Popa, C. L., L. F. Parpala et T. Aurite. « Problem Solving Algortihm for the Manufactruring Department Using Agent Technology ». Dans DAAAM International Scientific Book 2008, 603–12. DAAAM International, 2008. http://dx.doi.org/10.2507/daaam.scibook.2008.51.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Revathi, T., et K. Muneeswaran. « Congestion Control Using Soft Computing ». Dans Soft Computing Applications for Database Technologies, 271–89. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-814-7.ch014.

Texte intégral

Résumé :

In the recent Internet era the queue management in the routers plays a vital role in the provision of Quality of Service (QoS). Virtual queue-based marking schemes have been recently proposed for Active Queue Management (AQM) in Internet routers. In this chapter, the authors propose Fuzzy enabled AQM (F-AQM) scheme where the linguistics variables are used to specify the behavior of the queues in the routers. The status of the queue is continuously monitored and decisions are made adaptively to drop or mark the packets as is done in Random Early Discard (RED) and Random Early Marking (REM) algorthms or schemes. The authors design a fuzzy rule base represented in the form of matrix indexed by queue length and rate of change of queue. The performance of the proposed F-AQM scheme is compared with several well-known AQM schemes such as RED, REM and Adaptive Virtual Queue (AVQ).

Styles APA, Harvard, Vancouver, ISO, etc.

Engelmann, Alana Gabriela. « O USO DOS ALGORTIMOS COMO MEIO DE FORMAÇÃO DA DECISÃO JUDICIAL E O ACCOUNTABILITY ». Dans TEORIA CRÍTICA DO PROCESSO - Segunda Série. RFB Editora, 2022. http://dx.doi.org/10.46898/rfb.9786558893172.2.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Algortimi"

DePano, N. Adlai A., Farinaz D. Boudreaux, Philip Katner et Brian Li. « Algorthmic pradigms ». Dans the twenty-first SIGCSE technical symposium. New York, New York, USA : ACM Press, 1990. http://dx.doi.org/10.1145/323410.323448.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Valiant, Leslie G. « Accidental Algorthims ». Dans 2006 47th Annual IEEE Conference on Foundations of Computer Science. IEEE, 2006. http://dx.doi.org/10.1109/focs.2006.7.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Shea, Peter J., John Peterson, Kathleen Alexander et Alcino Azevedo. « Force aggregation using genetic algortihms ». Dans Optical Science and Technology, SPIE's 48th Annual Meeting, sous la direction de Oliver E. Drummond. SPIE, 2003. http://dx.doi.org/10.1117/12.506449.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Braginsky, David, et Deborah Estrin. « Rumor routing algorthim for sensor networks ». Dans the 1st ACM international workshop. New York, New York, USA : ACM Press, 2002. http://dx.doi.org/10.1145/570738.570742.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Li, Huan, et Chengsheng Pan. « An Adaptive Iterative Algorthm for System Identification ». Dans 2010 3rd International Conference on Intelligent Networks and Intelligent Systems (ICINIS). IEEE, 2010. http://dx.doi.org/10.1109/icinis.2010.27.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Penaloza Enriquez, Jorge Alberto, Mario I. Chacon-Murguia, Roberto Hernandez-Ceron et Gerardo Hernandez-Flores. « Algortihm for Daphnia Motion Detection in Toxicological Studies ». Dans 2018 15th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE). IEEE, 2018. http://dx.doi.org/10.1109/iceee.2018.8533966.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Ruochen Liu, Xiao Wang, Yangyang Li et Xiangrong Zhang. « Multi-objective Invasive Weed Optimization algortihm for clustering ». Dans 2012 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2012. http://dx.doi.org/10.1109/cec.2012.6256540.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Tangfei Tao, Ja Choon Koo et Hyouk Ryeol Choi. « A fast block matching algorthim for stereo correspondence ». Dans 2008 IEEE Conference on Cybernetics and Intelligent Systems (CIS). IEEE, 2008. http://dx.doi.org/10.1109/iccis.2008.4670774.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Cáceres, Edson Norberto. « Algortimos Paralelos para Árvores Geradoras e Componentes Conexos ». Dans Simpósio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho. Sociedade Brasileira de Computação, 1992. http://dx.doi.org/10.5753/sbac-pad.1992.22725.

Texte intégral

Résumé :

Dado um grafo G = (V, E) com n vértices em arestas, apresentamos uma implementação simples em uma CREW PRAM de algoritmos paralelos para computação da árvore geradora e dos componentes conexos de um grafo. Os algoritmos são executados em tempo paralelo O(log2n) com m/log n processadores. Caso o grafo esteja numerado de forma adequada os algoritmos são ótimos e são executados em tempo paralelo O(log n) com m/log n processadores.

Styles APA, Harvard, Vancouver, ISO, etc.

Amine, Ouardi, et Mestari Mohammed. « Predicting A search algortihm heuristics using neural networks ». Dans 2021 International Conference on Electrical, Computer and Energy Technologies (ICECET). IEEE, 2021. http://dx.doi.org/10.1109/icecet52533.2021.9698700.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!