Thematische Bibliographien / Algorithm

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Algorithm“

Autor: Grafiati
Veröffentlicht am 4. Juni 2021
Zuletzt aktualisiert am 25. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Algorithm" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Algorithm"

1

Gangavane, Ms H. N. "A Comparison of ABK-Means Algorithm with Traditional Algorithms." International Journal of Trend in Scientific Research and Development Volume-1, Issue-4 (2017): 614–21. http://dx.doi.org/10.31142/ijtsrd2197.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Jay, Kishore Sahani, and Kumar Yadav Arvind. "The Bees Algorithms in Optimization: An Overview." MATHEMATICS EDUCATION LV, no. 3, September 2021 (2021): 20–28. https://doi.org/10.5281/zenodo.7275730.

Der volle Inhalt der Quelle
Annotation:
            Metaheuristic algorithms have become powerful tools for modeling and optimization. In this article, we provide an overview of Bee Algorithms and their applications. We will briefly introduce algorithms such as bee algorithms, virtual bee algorithm, artificial bee algorithm, bee mating algorithm, etc. We also briefly the main characteristics of these algorithms and outline some recent applications of these algorithms. 
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Toleushova, A. T., D. M. Uypalakova, and A. B. Imansakipova. "SIGNATURE RECOGNITION ALGORITHMS. BEZIER ALGORITHM." Bulletin of Shakarim University. Technical Sciences, no. 3(7) (February 10, 2023): 47–53. http://dx.doi.org/10.53360/2788-7995-2022-1(5)-7.

Der volle Inhalt der Quelle
Annotation:
This article focuses on improving the human and machine interface, which should ensure efficient processing of data and knowledge in simple, fast and accessible ways. One of the ways to organize it is the introduction of the manuscript (entering text, drawings, drawings, etc.). Handwritten signatures can be considered as handwritten words, but they are more suitable for drawings, because the signer tries to make his signature unique, using not only his first and last names, but also additional graphic elements. Creating a signature is quite simple, although it is impossible to reproduce the re
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Lian, Jian, Yan Zhang, and Cheng Jiang Li. "An Efficient K-Shortest Paths Based Routing Algorithm." Advanced Materials Research 532-533 (June 2012): 1775–79. http://dx.doi.org/10.4028/www.scientific.net/amr.532-533.1775.

Der volle Inhalt der Quelle
Annotation:
We present an efficient K-shortest paths routing algorithm for computer networks. This Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF and IS-IS, which are only focusing on finding the shortest path route by adopting Dijkstra algorithm. Its desire effect to achieve is through the use of K-shortest paths algorighm, which has been implemented successfully in some fileds like traffic engineering. The correctness of this Algorithm is discussed at the same time as long as the comparison with OSPF.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Wisam, Abdulelah Qasim. "A HYBRID ALGORITHM BASED ON INVASIVE WEED OPTIMIZATION ALGORITHM AND GREY WOLF OPTIMIZATION ALGORITHM." International Journal of Artificial Intelligence and Applications (IJAIA) 11, January (2020): 31–44. https://doi.org/10.5281/zenodo.3690787.

Der volle Inhalt der Quelle
Annotation:
In this research, two algorithms first, considered to be one of hybrid algorithms. And it is algorithm represents invasive weed optimization. This algorithm is a random numerical algorithm and the second algorithm representing the grey wolves optimization. This algorithm is one of the algorithms of swarm intelligence in intelligent optimization. The algorithm of invasive weed optimization is inspired by nature as the weeds have colonial behavior and were introduced by Mehrabian and Lucas in 2006. Invasive weeds are a serious threat to cultivated plants because of their adaptability and are a t
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Ciric, Vladimir, Aleksandar Cvetkovic, Ivan Milentijevic, and Oliver Vojinovic. "All-Pairs Shortest Paths Algorithm for Regular 2D Mesh Topologies." JUCS - Journal of Universal Computer Science 22, no. (11) (2016): 1437–55. https://doi.org/10.3217/jucs-022-11-1437.

Der volle Inhalt der Quelle
Annotation:
Motivated by the large number of vertices that future technologies will put in the front of path-search algorithms, and inspired by highly regular 2D mesh structures that exist in the domain applications, in this paper we propose a new allpairs shortest paths algorithm, for any given regular 2D mesh topology, with complexity Ο(|V|2), where |V| is the number of vertices in the graph. The proposed algorithm can achieve better runtime than other known algorithms at the cost of narrowing the scope of the graphs that it can process to the graphs with regular 2D topology. The algorithm is developed
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Shaw, Dr Shaik Mohiddin, Dr Dharmaiah Gurram, Hari Krishna Gurram, and Ramakrishna Gurram. "Transitive Closure Algorithm using Binary OR Operation: Primes Algorithm, GHK Algorithm." SIJ Transactions on Computer Science Engineering & its Applications (CSEA) 03, no. 02 (2015): 01–05. http://dx.doi.org/10.9756/sijcsea/v3i2/03030100101.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Huang, Yuan Jiang, and Jie Huang. "A New Feature Detection Algorithm Based on RANSAC." Advanced Materials Research 971-973 (June 2014): 1477–80. http://dx.doi.org/10.4028/www.scientific.net/amr.971-973.1477.

Der volle Inhalt der Quelle
Annotation:
A improved RANSAC algorithm was introduced into the segmentation of LiDAR and r-radius point density was put forward to the estimation criterion,which aims to remove the discrete point outside the feature plane.an accurate registration is achieved by improving RANSAC algorithim after an analysis on the advantages and disadvantages of the algorithm for objects with many planar feature.The algorithm are implemented with VC++ and VTK platform,tested by real data collected on the test area,it verify the effectiveness and accuracy of the proposed algorithms.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Deghbouch, Hicham, and Fatima Debbat. "Hybrid Bees Algorithm with Grasshopper Optimization Algorithm for Optimal Deployment of Wireless Sensor Networks." Inteligencia Artificial 24, no. 67 (2021): 18–35. http://dx.doi.org/10.4114/intartif.vol24iss67pp18-35.

Der volle Inhalt der Quelle
Annotation:
This work addresses the deployment problem in Wireless Sensor Networks (WSNs) by hybridizing two metaheuristics, namely the Bees Algorithm (BA) and the Grasshopper Optimization Algorithm (GOA). The BA is an optimization algorithm that demonstrated promising results in solving many engineering problems. However, the local search process of BA lacks efficient exploitation due to the random assignment of search agents inside the neighborhoods, which weakens the algorithm’s accuracy and results in slow convergence especially when solving higher dimension problems. To alleviate this shortcoming,
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Sami N. Hussein and Nazar K. Hussein. "Improving Moth-Flame Optimization Algorithm by using Slime-Mould Algorithm." Tikrit Journal of Pure Science 27, no. 1 (2022): 99–109. http://dx.doi.org/10.25130/tjps.v27i1.86.

Der volle Inhalt der Quelle
Annotation:
The MFO algorithm is one of the modern optimization algorithms based on swarm intelligence, and the SMA algorithm is also one of the latest algorithms in the same field and has the advantages of fast convergence, high convergence accuracy, robust and robust. In this research paper, we introduce an optimized algorithm for MFO based on the SMA algorithm to get better performance using the features in the two algorithms, and two different algorithms are proposed in this field. The two predicted new algorithms were tested with standard test functions and the results were encouraging compared to th
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Dissertationen zum Thema "Algorithm"

1

Yarmolskyy, Oleksandr. "Využití distribuovaných a stochastických algoritmů v síti." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2018. http://www.nusl.cz/ntk/nusl-370918.

Der volle Inhalt der Quelle
Annotation:
This thesis deals with the distributed and stochastic algorithms including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Furthermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in Matlab.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Harris, Steven C. "A genetic algorithm for robust simulation optimization." Ohio : Ohio University, 1996. http://www.ohiolink.edu/etd/view.cgi?ohiou1178645751.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Gauthier, Morgan. "Déploiement haut niveau d'applications automobiles sur les architectures E/E futures." Electronic Thesis or Diss., Toulouse, ISAE, 2024. http://www.theses.fr/2024ESAE0037.

Der volle Inhalt der Quelle
Annotation:
Cette thèse aborde les défis liés à la conception des futures architectures électriques/électroniques automobiles, en se concentrant particulièrement sur l’estimation des ressources de calcul au cours des premières phases de conception. L’étude passe en revue l’évolution historique des architectures E/E, soulignant la complexité croissante et les limites des systèmes décentralisés traditionnelsau cours de l’évolution de l’industrie automobile. L’énoncé du problème souligne la nécessité d’une estimation précise des ressources informatiques au début du processus de conception, en particulier dan
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Nyman, Peter. "Representation of Quantum Algorithms with Symbolic Language and Simulation on Classical Computer." Licentiate thesis, Växjö University, School of Mathematics and Systems Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-2329.

Der volle Inhalt der Quelle
Annotation:
<p>Utvecklandet av kvantdatorn är ett ytterst lovande projekt som kombinerar teoretisk och experimental kvantfysik, matematik, teori om kvantinformation och datalogi. Under första steget i utvecklandet av kvantdatorn låg huvudintresset på att skapa några algoritmer med framtida tillämpningar, klargöra grundläggande frågor och utveckla en experimentell teknologi för en leksakskvantdator som verkar på några kvantbitar. Då dominerade förväntningarna om snabba framsteg bland kvantforskare. Men det verkar som om dessa stora förväntningar inte har besannats helt. Många grundläggande och tekniska pro
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Maciel, Cristiano Baptista Faria. "A memetic algorithm for logistics network design problems." Master's thesis, Instituto Superior de Economia e Gestão, 2014. http://hdl.handle.net/10400.5/8601.

Der volle Inhalt der Quelle
Annotation:
Mestrado em Decisão Económica e Empresarial<br>Neste trabalho, um algoritmo memético é desenvolvido com o intuito de ser aplicado a uma rede logística, com três níveis, múltiplos períodos, seleção do meio de transporte e com recurso a outsourcing. O algoritmo memético pode ser aplicado a uma rede logística existente, no sentido de otimizar a sua configuração ou, se necessário, pode ser utilizado para criar uma rede logística de raiz. A produção pode ser internalizada e é permitido o envio direto de produtos para os clientes. Neste problema, as capacidades das diferentes infraestruturas podem s
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Dementiev, Roman. "Algorithm engineering for large data sets hardware, software, algorithms." Saarbrücken VDM, Müller, 2006. http://d-nb.info/986494429/04.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Dementiev, Roman. "Algorithm engineering for large data sets : hardware, software, algorithms /." Saarbrücken : VDM-Verl. Dr. Müller, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=3029033&prov=M&dok_var=1&dok_ext=htm.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Khungurn, Pramook. "Shirayanagi-Sweedler algebraic algorithm stabilization and polynomial GCD algorithms." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/41662.

Der volle Inhalt der Quelle
Annotation:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.<br>Includes bibliographical references (p. 71-72).<br>Shirayanagi and Sweedler [12] proved that a large class of algorithms on the reals can be modified slightly so that they also work correctly on floating-point numbers. Their main theorem states that, for each input, there exists a precision, called the minimum converging precision (MCP), at and beyond which the modified "stabilized" algorithm follows the same sequence of steps as the original "exact" algorithm. In this thesis
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Johansson, Björn, and Emil Österberg. "Algorithms for Large Matrix Multiplications : Assessment of Strassen's Algorithm." Thesis, KTH, Skolan för teknikvetenskap (SCI), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-230742.

Der volle Inhalt der Quelle
Annotation:
1968 var Strassens algoritm en av de stora genombrotten inom matrisanalyser. I denna rapport kommer teorin av Volker Strassens algoritm för matrismultiplikationer tillsammans med teorier om precisioner att presenteras. Även fördelar med att använda denna algoritm jämfört med naiva matrismultiplikation och dess implikationer, samt hur den presterar jämfört med den naiva algoritmen kommer att presenteras. Strassens algoritm kommer också att bli bedömd på hur dess resultat skiljer sig för olika precisioner när matriserna blir större, samt hur dess teoretiska komplexitet skiljer sig gentemot den e
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Čápek, Pavel. "Srovnání nástrojů pro animaci algoritmů." Master's thesis, Vysoká škola ekonomická v Praze, 2012. http://www.nusl.cz/ntk/nusl-192639.

Der volle Inhalt der Quelle
Annotation:
The diploma thesis focuses on software tools which enable algorithm animation. In theoretical section of the work are introduced different ways how to present algorithms. Then the field of algorithm animation is described; it's history, development and current state. In the last part of theoretical section are shown possibilities how to use algorithm animation in teaching. Practical section of the thesis focuses on comparison of selected software tools. Selected tools are evaluated based on several criteria. The applications are then compared by multi-criteria decision making methods. Main goa
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Bücher zum Thema "Algorithm"

1

Müller-Hannemann, Matthias, and Stefan Schirra. Algorithm engineering: Bridging the gap between algorithm theory and practice. Springer, 2010.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Feldbauer, Martin. Martin Feldbauer: Allmächtiger Algorithmus = Almighty algorithm. Syker Vorwerk, 2017.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Souravlias, Dimitris, Konstantinos E. Parsopoulos, Ilias S. Kotsireas, and Panos M. Pardalos. Algorithm Portfolios. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68514-0.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Müller-Hannemann, Matthias, and Stefan Schirra, eds. Algorithm Engineering. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14866-8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Vitter, Jeffrey S., and Christos D. Zaroliagis, eds. Algorithm Engineering. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48318-7.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Kliemann, Lasse, and Peter Sanders, eds. Algorithm Engineering. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49487-6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Brodal, Gerth Stølting, Daniele Frigioni, and Alberto Marchetti-Spaccamela, eds. Algorithm Engineering. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44688-5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Näher, Stefan, and Dorothea Wagner, eds. Algorithm Engineering. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44691-5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Tan, Ying. Fireworks Algorithm. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-46353-6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Swann, S. Andrew. Zimmerman's algorithm. Daw Books, Inc., 2000.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Buchteile zum Thema "Algorithm"

1

Bez, Helmut, and Tony Croft. "Quantum algorithms 2: Simon's algorithm." In Quantum Computation. Chapman and Hall/CRC, 2023. http://dx.doi.org/10.1201/9781003264569-23.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Nassehi, Aydin. "Algorithm." In CIRP Encyclopedia of Production Engineering. Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-642-35950-7_16769-1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Shekhar, Shashi, and Hui Xiong. "Algorithm." In Encyclopedia of GIS. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_46.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Gass, Saul I., and Carl M. Harris. "algorithm." In Encyclopedia of Operations Research and Management Science. Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_1013.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Gass, Saul I., and Carl M. Harris. "algorithm." In Encyclopedia of Operations Research and Management Science. Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_284.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Gass, Saul I., and Carl M. Harris. "algorithm." In Encyclopedia of Operations Research and Management Science. Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_316.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Gass, Saul I., and Carl M. Harris. "algorithm." In Encyclopedia of Operations Research and Management Science. Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_494.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Gass, Saul I., and Carl M. Harris. "algorithm." In Encyclopedia of Operations Research and Management Science. Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_795.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Gass, Saul I., and Carl M. Harris. "algorithm." In Encyclopedia of Operations Research and Management Science. Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_931.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Nahler, Gerhard. "algorithm." In Dictionary of Pharmaceutical Medicine. Springer Vienna, 2009. http://dx.doi.org/10.1007/978-3-211-89836-9_45.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Algorithm"

1

Dasgupta, Anubhab, Vedant Zope, and Asrul Harun Ismail. "Implementation of the Bees Algorithm for UAV Mission Plan." In 14th International Seminar on Industrial Engineering and Management. Trans Tech Publications Ltd, 2025. https://doi.org/10.4028/p-nad6qa.

Der volle Inhalt der Quelle
Annotation:
The increasing use of Unmanned Aerial Vehicles (UAVs) in various applications, such as military operations and civilian tasks, has created a demand for efficient algorithms to plan their mission. This study explores the use of the Bees Algorithm (BA), a nature-inspired optimisation method, to solve two main problems in UAV mission planning: the UAV collision avoidance problem (UCAP) and the Asymmetric TSP (ATSP). Results of comparison between the proposed algorithm and other metaheuristic algorithms indicate that BA can produce competitive solutions. However, the study also found that the BA h
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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.

Der volle Inhalt der Quelle
Annotation:
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.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Tran, Tan D., Canh V. Pham, Dung T. K. Ha, and Phuong N. H. Pham. "Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/217.

Der volle Inhalt der Quelle
Annotation:
This work proposes an efficient parallel algorithm for non-monotone submodular maximization under a knapsack constraint problem over the ground set of size n. Our algorithm improves the best approximation factor of the existing parallel one from 8 to 7 with O(log n) adaptive complexity. The key idea of our approach is to create an alternate threshold algorithmic framework. This new strategy alternately constructs two disjoint candidate solutions within a constant number of sequence rounds. Then, the algorithm boosts solution quality without sacrificing the adaptive complexity. Extensive experi
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Wu, Xingyu, Yan Zhong, Jibin Wu, Bingbing Jiang, and Kay Chen Tan. "Large Language Model-Enhanced Algorithm Selection: Towards Comprehensive Algorithm Representation." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/579.

Der volle Inhalt der Quelle
Annotation:
Algorithm selection, a critical process of automated machine learning, aims to identify the most suitable algorithm for solving a specific problem prior to execution. Mainstream algorithm selection techniques heavily rely on problem features, while the role of algorithm features remains largely unexplored. Due to the intrinsic complexity of algorithms, effective methods for universally extracting algorithm information are lacking. This paper takes a significant step towards bridging this gap by introducing Large Language Models (LLMs) into algorithm selection for the first time. By comprehendi
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

El-Mihoub, Tarek A., Christoph Tholen, and Lars Nolle. "A Simple Algorithm Selector for Continuous Optimisation Problems." In 36th ECMS International Conference on Modelling and Simulation. ECMS, 2022. http://dx.doi.org/10.7148/2022-0099.

Der volle Inhalt der Quelle
Annotation:
A large number of algorithms has been proposed for solving continuous optimisation problems. However, there is limited theoretical understanding of the strengths and weaknesses of most algorithms and their individual applicability. Furthermore, the performance of these algorithms is highly dependent on their control parameters, which need to be configured to achieve a peak performance. Automating the processes of selecting the most suitable algorithm and the right control parameters can help in solving continuous optimisation problems effectively and efficiently. In this paper, a simple online
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Degroote, Hans. "Online Algorithm Selection." 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/746.

Der volle Inhalt der Quelle
Annotation:
Algorithm selection approaches have achieved impressive performance improvements in many areas of AI. Most of the literature considers the offline algorithm selection problem, where the initial selection model is never updated after training. However, new data from running algorithms on instances becomes available while an algorithm selection method is in use. In this extended abstract, the online algorithm selection problem is considered. In online algorithm selection, additional data can be processed, and the selection model can change over time. This abstract details the online algorithm se
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Eggensperger, Katharina, Marius Lindauer, and Frank Hutter. "Neural Networks for Predicting Algorithm Runtime Distributions." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/200.

Der volle Inhalt der Quelle
Annotation:
Many state-of-the-art algorithms for solving hard combinatorial problems in artificial intelligence (AI) include elements of stochasticity that lead to high variations in runtime, even for a fixed problem instance. Knowledge about the resulting runtime distributions (RTDs) of algorithms on given problem instances can be exploited in various meta-algorithmic procedures, such as algorithm selection, portfolios, and randomized restarts. Previous work has shown that machine learning can be used to individually predict mean, median and variance of RTDs. To establish a new state-of-the-art in predic
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Guo, Lei, Lijian Zhou, Shaohui Jia, Li Yi, Haichong Yu, and Xiaoming Han. "An Automatic Segmentation Algorithm Used in Pipeline Integrity Alignment Sheet Design." In 2010 8th International Pipeline Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/ipc2010-31036.

Der volle Inhalt der Quelle
Annotation:
Pipeline segmentation design is the first step to design alignment sheet. In this step, several rectangular boxes are used to cover pipeline and each box will become the basic unit of alignment sheet design. After studying various pipeline alignment sheet mapping technologies, the author found that traditional manual design method, which can take advantage of designers’ subjectivity, causes low work efficiency. By reviewing and studying existing works at home and abroad, the author believed that it is possible and feasible to develop an automatic segmentation algorithm based on existing curve
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Huang, Fuxin, Lijue Wang, and Chi Yang. "Ship Hull Form Optimization Using Artificial Bee Colony Algorithm." In SNAME Maritime Convention. SNAME, 2014. http://dx.doi.org/10.5957/smc-2014-t47.

Der volle Inhalt der Quelle
Annotation:
In this paper, artificial bee colony (ABC) algorithms are introduced to optimize ship hull forms for reduced drag. Two versions of ABC algorithm are used: one is the basic ABC algorithm, and the other is an improved artificial bee colony (IABC) algorithm. A recently developed fast flow solver based on the Neumann-Michell theory is used to evaluate the drag of the ship in the optimization process. The ship hull surface is represented by discrete triangular panels and modified using radial basis function interpolation method. The developed optimization algorithms are first validated by benchmark
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Murukesh, Aadhithya, and R. Logeshwari. "Rock, Paper and Scissor Using AI- Random Forest Algorithm." In International Research Conference on IOT, Cloud and Data Science. Trans Tech Publications Ltd, 2023. http://dx.doi.org/10.4028/p-udj0cq.

Der volle Inhalt der Quelle
Annotation:
Rock, paper, scissors (RPS) is a game of crucial decision-making that can be used to test various learning algorithms due to its simplicity. Random Forest is a Rock Paper Scissors Agent that makes predictions using the Random Forest Classification with a bit of random. The randomness on this agent has been limited only while losing (and partially due to window length), displaying the algorithm's true potential. A simulation of various AI agents is developed to compare and analyze against the Random forest algorithm.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Algorithm"

1

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

Der volle Inhalt der Quelle
Annotation:
Obwohl Algorithmen in vielen Anwendungsgebieten präzisere Prognosen abgeben als Menschen, weigern sich Entscheidungsträger häufig, auf Algorithmen zurückzugreifen. In einem ökonomischen Experiment untersuchen wir, ob das Ausmaß dieses als „Algorithm Aversion“ bekannten Phänomens reduziert werden kann, indem Entscheidungsträgern eine Einflussmöglichkeit auf die Ausgestaltung des Algorithmus eingeräumt wird (Einflussmöglichkeit auf den algorithmischen Input). Zusätzlich replizieren wir die Studie von Dietvorst, Simmons &amp; Massey (2018). Darin zeigt sich, dass die Algorithm Aversion deutlich z
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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

Der volle Inhalt der Quelle
Annotation:
Algorithmen bewältigen viele Aufgaben bereits zuverlässiger als menschliche Experten. Trotzdem zeigen einige Wirtschaftssubjekte eine ablehnende Haltung gegenüber Algorithmen (Algorithm Aversion). In manchen Entscheidungssituationen kann ein Fehler schwerwiegende Konsequenzen haben, in anderen Entscheidungssituationen nicht. Wir untersuchen im Rahmen eines Framing-Experimentes den Zusammenhang zwischen der Tragweite der Entscheidungssituation einerseits und der Häufigkeit der Algorithm Aversion andererseits. Dabei zeigt sich, dass die Algorithm Aversion umso häufiger auftritt, je gravierender
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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.

Der volle Inhalt der Quelle
Annotation:
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
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

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

Der volle Inhalt der Quelle
Annotation:
Der Prozess der Entscheidungsfindung wird in verschiedensten Kontexten immer häufiger von Algorithmen unterstützt. Das Phänomen der Algorithm Aversion steht der Entfaltung des technologischen Potenzials, das Algorithmen mit sich bringen, jedoch entgegen. Wirtschaftsakteure neigen dazu, ihre Entscheidungen an den Entscheidungen anderer Wirtschaftsakteure auszurichten. Daher wird in einem experimentellen Ansatz die Bereitschaft zur Nutzung eines Algorithmus bei der Abgabe von Aktienkursprognosen untersucht, wenn Informationen über die vorherige Nutzungsrate eines Algorithmus bereitgestellt werde
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Marty, Frédéric, and Thierry Warin. Deciphering Algorithmic Collusion: Insights from Bandit Algorithms and Implications for Antitrust Enforcement. CIRANO, 2023. http://dx.doi.org/10.54932/iwpg7510.

Der volle Inhalt der Quelle
Annotation:
This paper examines algorithmic collusion from legal and economic perspectives, highlighting the growing role of algorithms in digital markets and their potential for anti-competitive behavior. Using bandit algorithms as a model, traditionally applied in uncertain decision-making contexts, we illuminate the dynamics of implicit collusion without overt communication. Legally, the challenge is discerning and classifying these algorithmic signals, especially as unilateral communications. Economically, distinguishing between rational pricing and collusive patterns becomes intricate with algorithm-
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

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.

Der volle Inhalt der Quelle
Annotation:
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
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

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

Der volle Inhalt der Quelle
Annotation:
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
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Champlin, Craig, and John P. H. Steele. DTPH56-14H-CAP06 Pipeline Assessment through 4-Dimensional Anomaly Detection and Characterization. Pipeline Research Council International, Inc. (PRCI), 2016. http://dx.doi.org/10.55274/r0011766.

Der volle Inhalt der Quelle
Annotation:
The team intended to develop two algorithms for matching anomalies across coincident internal pipeline inspections to assess corrosion growth rates. The first algorithm would match boxed anomalies. The second algorithm would match raw signals. The goal for each algorithm is slightly different. The boxed algorithm is intended to do a complete mapping of individual called-out anomalies from one inspection to the next. The raw signal algorithm velocity corrects and aligns raw inspections signals.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Filiz, Ibrahim, Jan René Judek, Marco Lorenz, and Markus Spiwoks. Reduzierung der Algorithm Aversion durch Erfahrung. Sonderforschungsgruppe Institutionenanalyse, 2021. http://dx.doi.org/10.46850/sofia.9783941627864.

Der volle Inhalt der Quelle
Annotation:
Wir untersuchen experimentell die Persistenz der Algorithm Aversion im Hinblick auf Lernprozesse. Probanden sind aufgefordert in 40 Runden je eine Aktienkursprognose (steigend oder fallend) abzugeben. Es steht ein Prognosecomputer (Algorithmus) zur Verfügung, der eine Erfolgsquote von 70% aufweist. Intuitive Prognosen der Probanden führen in aller Regel zu einer deutlich schlechteren Erfolgsquote. Feedbacks nach jeder Prognoserunde und ein klarer ökonomischer Anreiz führen dazu, dass die Probanden ihre eigenen Prognosefähigkeiten besser einzuschätzen lernen. Dabei geht auch die Algorithm Avers
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

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

Der volle Inhalt der Quelle
Annotation:
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 partic
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Algorithm" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen Bücher
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie