Relevant bibliographies by topics / Algorithm

Contents

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

Academic literature on the topic 'Algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 9 June 2025

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

Select a source type:

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

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

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

Journal articles on the topic "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 (June 30, 2017): 614–21. http://dx.doi.org/10.31142/ijtsrd2197.

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

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

Full text
Abstract:
            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, and other styles
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.

Full text
Abstract:
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 recording speed. The signature has long been used to certify the authenticity of documents and verify (authenticate) an individual. In principle, the signature examination is used during the forensic examination. Signature recognition can be carried out by sequential verification of the signature to each known person. The signature recognition methodology includes a verification methodology and processing of verification results. One of the modern areas of interface improvement is the development and research of software for signature recognition and visualization. The advent of modern computer input tools has led to the emergence of a new type of online signature describing the signature creation process, not the result. Moreover, not only the coordinates of points on the line, but also a sequence of vectors of parameter values for each of the values of pressure, direction and speed of movement, the angle of adaptation of the pen and the signature time.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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, and other styles
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 (February 28, 2020): 31–44. https://doi.org/10.5281/zenodo.3690787.

Full text
Abstract:
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 threat to the overall planting process. The behavior of these weeds has been studied and applied in the invasive weed algorithm. The algorithm of grey wolves, which is considered as a swarm intelligence algorithm, has been used to reach the goal and reach the best solution. The algorithm was designed by SeyedaliMirijalili in 2014 and taking advantage of the intelligence of the squadrons is to avoid falling into local solutions so the new hybridization process between the previous algorithms GWO and IWO and we will symbolize the new algorithm IWOGWO.Comparing the suggested hybrid algorithm with the original algorithms it results were excellent. The optimum solution was found in most of test functions.
APA, Harvard, Vancouver, ISO, and other styles
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) (November 1, 2016): 1437–55. https://doi.org/10.3217/jucs-022-11-1437.

Full text
Abstract:
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 into formalism by algebraic transformations in tropical algebra of the well-known Floyd-Warshall's algorithm. First we prove the equivalency of the Floyd-Warshall's algorithm and its tropical algebraic representation, and put the transformations of the algorithm into the algebraic domain. Secondly, having in mind the structure of the target class of graphs, we transform the original algorithm in the algebraic domain and develop a simple, low-complexity iterative algorithm for all-pairs shortest paths calculation. Decreasing of computational complexity can contribute to better exploitation of the algorithm in the wide range of applications from hardware design in new emerging technologies to big data problems in information technologies.
APA, Harvard, Vancouver, ISO, and other styles
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 (April 23, 2015): 01–05. http://dx.doi.org/10.9756/sijcsea/v3i2/03030100101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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, and other styles
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 (February 20, 2021): 18–35. http://dx.doi.org/10.4114/intartif.vol24iss67pp18-35.

Full text
Abstract:
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, this paper proposes a hybrid algorithm that utilizes the strength of the GOA to enhance the exploitation phase of the BA. To prove the effectiveness of the proposed algorithm, it is applied for WSNs deployment optimization with various deployment settings. Results demonstrate that the proposed hybrid algorithm can optimize the deployment of WSN and outperforms the state-of-the-art algorithms in terms of coverage, overlapping area, average moving distance, and energy consumption.
APA, Harvard, Vancouver, ISO, and other styles
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 (December 2, 2022): 99–109. http://dx.doi.org/10.25130/tjps.v27i1.86.

Full text
Abstract:
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 the standard algorithms.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "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.

Full text
Abstract:
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, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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 dans le contexte des demandes de devis de l’industrie automobile. Les méthodologies actuelles sont évaluées et jugées insuffisantes pour répondre aux exigences des futurs systèmes automobiles centralisés. Par conséquent, une question de recherche est formulée pour guider le développement d’une nouvelle méthodologie visant à améliorer la précision et l’efficacité de l’estimation des ressources. La méthodologie proposée fonctionne comme un guide de décision de haut niveau et incorpore le paradigme du temps d’exécution logique (LET) pour assurer une communication déterministe sur les plates-formes multicoeurs. Cette approche tient compte des contraintes propres aux systèmes automobiles, notamment les contraintes de temps réel, d’exécution, d’espace et d’utilisation des ressources. La méthodologie vise également à prendre en compte l’évolutivité du système dès le début de la conception en explorant les stratégies de partitionnement et d’affectation<br>This thesis addresses challenges in designing future automotive Electrical/Electronic architectures, particularly focusing on estimating computational resources during early design. The study reviews the historical evolution of E/E architectures, highlighting the increasing complexity and the limitations of traditional decentralized systems as vehicles evolve. The problem statement emphasizes the need for accurate computational resource estimation early in the design process, particularly within the context of request for quotations in the automotive industry. Current methodologies are evaluated and found lacking inaddressing the demands of future centralized automotive systems. Consequently, a research question is formulated to guide the development of a new methodology for improving resource estimation accuracy and efficiency. The proposed methodology functions as a high-level decision guide and incorporates the Logical Execution Time (LET) paradigm to ensure deterministic communication on multi-core platforms. This approach addresses the unique constraints of automotive systems, including real-time, execution, spatial and resource utilization constraints. The methodology also aims to account for system scalability duringearly design by exploring partitioning and assignment strategies
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
<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 problem som dekoherens hos kvantbitarna och instabilitet i kvantstrukturen skapar redan vid ett litet antal register tvivel om en snabb utveckling av kvantdatorer som verkligen fungerar. Trots detta kan man inte förneka att stora framsteg gjorts inom kvantteknologin. Det råder givetvis ett stort gap mellan skapandet av en leksakskvantdator med 10-15 kvantregister och att t.ex. tillgodose de tekniska förutsättningarna för det projekt på 100 kvantregister som aviserades för några år sen i USA. Det är också uppenbart att svårigheterna ökar ickelinjärt med ökningen av antalet register. Därför är simulering av kvantdatorer i klassiska datorer en viktig del av kvantdatorprojektet. Självklart kan man inte förvänta sig att en kvantalgoritm skall lösa ett NP-problem i polynomisk tid i en klassisk dator. Detta är heller inte syftet med klassisk simulering. Den klassiska simuleringen av kvantdatorer kommer att täcka en del av gapet mellan den teoretiskt matematiska formuleringen av kvantmekaniken och ett förverkligande av en kvantdator. Ett av de viktigaste problemen i vetenskapen om kvantdatorn är att utveckla ett nytt symboliskt språk för kvantdatorerna och att anpassa redan existerande symboliska språk för klassiska datorer till kvantalgoritmer. Denna avhandling ägnas åt en anpassning av det symboliska språket Mathematica till kända kvantalgoritmer och motsvarande simulering i klassiska datorer. Konkret kommer vi att representera Simons algoritm, Deutsch-Joszas algoritm, Grovers algoritm, Shors algoritm och kvantfelrättande koder i det symboliska språket Mathematica. Vi använder samma stomme i alla dessa algoritmer. Denna stomme representerar de karaktäristiska egenskaperna i det symboliska språkets framställning av kvantdatorn och det är enkelt att inkludera denna stomme i framtida algoritmer.</p><br><p>Quantum computing is an extremely promising project combining theoretical and experimental quantum physics, mathematics, quantum information theory and computer science. At the first stage of development of quantum computing the main attention was paid to creating a few algorithms which might have applications in the future, clarifying fundamental questions and developing experimental technologies for toy quantum computers operating with a few quantum bits. At that time expectations of quick progress in the quantum computing project dominated in the quantum community. However, it seems that such high expectations were not totally justified. Numerous fundamental and technological problems such as the decoherence of quantum bits and the instability of quantum structures even with a small number of registers led to doubts about a quick development of really working quantum computers. Although it can not be denied that great progress had been made in quantum technologies, it is clear that there is still a huge gap between the creation of toy quantum computers with 10-15 quantum registers and, e.g., satisfying the technical conditions of the project of 100 quantum registers announced a few years ago in the USA. It is also evident that difficulties increase nonlinearly with an increasing number of registers. Therefore the simulation of quantum computations on classical computers became an important part of the quantum computing project. Of course, it can not be expected that quantum algorithms would help to solve NP problems for polynomial time on classical computers. However, this is not at all the aim of classical simulation. Classical simulation of quantum computations will cover part of the gap between the theoretical mathematical formulation of quantum mechanics and the realization of quantum computers. One of the most important problems in "quantum computer science" is the development of new symbolic languages for quantum computing and the adaptation of existing symbolic languages for classical computing to quantum algorithms. The present thesis is devoted to the adaptation of the Mathematica symbolic language to known quantum algorithms and corresponding simulation on the classical computer. Concretely we shall represent in the Mathematica symbolic language Simon's algorithm, the Deutsch-Josza algorithm, Grover's algorithm, Shor's algorithm and quantum error-correcting codes. We shall see that the same framework can be used for all these algorithms. This framework will contain the characteristic property of the symbolic language representation of quantum computing and it will be a straightforward matter to include this framework in future algorithms.</p>
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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 ser expandidas ao longo do período temporal. Caso se trate uma infraestrutura já existente, após uma expansão, já não pode ser encerrada. Sempre que se abre uma nova infraestrutura, a mesma também não pode ser encerrada. A heurística é capaz de determinar o número e localizações das infraestrutura a operar, as capacidades e o fluxo de mercadoria na rede logística.<br>This thesis describes a memetic algorithm applied to the design of a three-echelon logistics network over multiple periods with transportation mode selection and outsourcing. The memetic algorithm can be applied to an existing supply chain in order to obtain an optimized configuration or, if required, it can be used to define a new logistics network. In addition, production can be outsourced and direct shipments of products to customer zones are possible. In this problem, the capacity of an existing or new facility can be expanded over the time horizon. In this case, the facility cannot be closed. Existing facilities, once closed, cannot be reopened. New facilities cannot be closed, once opened. The heuristic is able to determine the number and locations of facilities (i.e. plants and warehouses), capacity levels as well as the flow of products throughout the supply chain.
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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, we study the MCP of two algorithms for finding the greatest common divisor of two univariate polynomials with real coefficients: the Euclidean algorithm, and an algorithm based on QR-factorization. We show that, if the coefficients of the input polynomials are allowed to be any computable numbers, then the MCPs of the two algorithms are not computable, implying that there are no "simple" bounding functions for the MCP of all pairs of real polynomials. For the Euclidean algorithm, we derive upper bounds on the MCP for pairs of polynomials whose coefficients are members of Z, 0, Z[6], and Q[6] where ( is a real algebraic integer. The bounds are quadratic in the degrees of the input polynomials or worse. For the QR-factorization algorithm, we derive a bound on the minimal precision at and beyond which the stabilized algorithm gives a polynomial with the same degree as that of the exact GCD, and another bound on the the minimal precision at and beyond which the algorithm gives a polynomial with the same support as that of the exact GCD. The bounds are linear in (1) the degree of the polynomial and (2) the sum of the logarithm of diagonal entries of matrix R in the QR factorization of the Sylvester matrix of the input polynomials.<br>by Pramook Khungurn.<br>M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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 erhållna komplexiteten. Studier hittade att Strassens algoritm överträffade den naiva algoritmen för matriser av storlek 1024×1024 och större. Den erhållna komplexiteten var lite större än Volker Strassens teoretiska. Den optimala precisionen i detta fall var dubbelprecisionen, Float64. Sättet algoritmen implementeras på i koden påverkar dess prestanda. Ett flertal olika faktorer behövs ha i åtanke för att förbättra Strassens algoritm: optimera dess avbrottsvillkor, sättet som matriserna paddas för att de ska vara mer användbara för rekursiv tillämpning och hur de implementeras t.ex. parallella beräkningar. Även om det kunde bevisas att Strassen algoritm överträffade den naiva efter en viss matrisstorlek så är den inte den mest effektiva; t.ex visades detta med Strassen-Winograd. Man behöver vara uppmärksam på hur undermatriserna allokeras, för att inte ta upp onödigt minne. För fördjupning kan man läsa på om cache-oblivious och cache-aware algoritmer.<br>Strassen’s algorithm was one of the breakthroughs in matrix analysis in 1968. In this report the thesis of Volker Strassen’s algorithm for matrix multipli- cations along with theories about precisions will be shown. The benefits of using this algorithm compared to naive matrix multiplication and its implica- tions, how its performance compare to the naive algorithm, will be displayed. Strassen’s algorithm will also be assessed on how the output differ when the matrix sizes grow larger, as well as how the theoretical complexity of the al- gorithm differs from the achieved complexity. The studies found that Strassen’s algorithm outperformed the naive matrix multiplication at matrix sizes 1024 1024 and above. The achieved complex- ity was a little higher compared to Volker Strassen’s theoretical. The optimal precision for this case were the double precision, Float64. How the algorithm is implemented in code matters for its performance. A number of techniques need to be considered in order to improve Strassen’s algorithm, optimizing its termination criterion, the manner by which it is padded in order to make it more usable for recursive application and the way it is implemented e.g. parallel computing. Even tough it could be proved that Strassen’s algorithm outperformed the Naive after reaching a certain matrix size, it is still not the most efficient one; e.g. as shown with Strassen-Winograd. One need to be careful of how the sub-matrices are being allocated, to not use unnecessary memory. For further reading one can study cache-oblivious and cache-aware algorithms.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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 goal of this thesis is to compare the selected software tools. Partial goals are to introduce advantages of using such applications compared to writing the algorithm in text form.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Algorithm"

1

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Swann, S. Andrew. Zimmerman's algorithm. New York, NY: Daw Books, Inc., 2000.

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

Book chapters on the topic "Algorithm"

1

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Conference papers on the topic "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, 11–18. Switzerland: Trans Tech Publications Ltd, 2025. https://doi.org/10.4028/p-nad6qa.

Full text
Abstract:
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 had a deviation of 10% on ATSP instances, whereas it was able to achieve similar deviation when solving symmetrical TSP of 200 dimensions. This highlights the need for further improvement of the neighbour search mechanism in the BA for better accuracy on the problems.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
For clustering a large Design Structure Matrix (DSM), computerized algorithms are necessary. A common algorithm by Thebeau uses stochastic hill-climbing to avoid local optima. The output of the algorithm is stochastic, and to be certain a very good clustering solution has been obtained, it may be necessary to run the algorithm thousands of times. To make this feasible in practice, the algorithm must be computationally efficient. Two algorithmic improvements are presented. Together they improve the quality of the results obtained and increase speed significantly for normal clustering problems. The proposed new algorithm is applied to a cordless handheld vacuum cleaner.
APA, Harvard, Vancouver, ISO, and other styles
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}. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/217.

Full text
Abstract:
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 experimental studies on three applications, Revenue Maximization, Image Summarization, and Maximum Weighted Cut, show that our algorithm not only significantly increases solution quality but also requires comparative adaptivity to state-of-the-art algorithms.
APA, Harvard, Vancouver, ISO, and other styles
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}. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/579.

Full text
Abstract:
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 comprehending the code text, LLM not only captures the structural and semantic aspects of the algorithm, but also demonstrates contextual awareness and library function understanding. The high-dimensional algorithm representation extracted by LLM, after undergoing a feature selection module, is combined with the problem representation and passed to the similarity calculation module. The selected algorithm is determined by the matching degree between a given problem and different algorithms. Extensive experiments validate the performance superiority of the proposed model and the efficacy of each key module. Furthermore, we present a theoretical upper bound on model complexity, showcasing the influence of algorithm representation and feature selection modules. This provides valuable theoretical guidance for the practical implementation of our method.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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 algorithm selector is proposed. It decides on selecting the right algorithm based on the current state of the search process to solve a given problem. Each algorithm in the portfolio of the algorithm selector competes with others and utilises the results of other algorithms to locate the global optimum. The proposed algorithm selector and the algorithms of the portfolio as stand-alone algorithms were benchmarked on the noise-free BBOB-2009 testbed. The results show that the performance of the simple algorithm selector is better than the performances of the individual algorithms in general. It was also able to solve eleven out of twenty-four functions of the test suite to the ultimate accuracy of 10-8.
APA, Harvard, Vancouver, ISO, and other styles
6

Degroote, Hans. "Online Algorithm Selection." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/746.

Full text
Abstract:
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 setting, shows that it is a contextual multi-armed bandit, proposes a solution methodology, and empirically validates it.
APA, Harvard, Vancouver, ISO, and other styles
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}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/200.

Full text
Abstract:
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 predicting RTDs, we demonstrate that the parameters of an RTD should be learned jointly and that neural networks can do this well by directly optimizing the likelihood of an RTD given runtime observations. In an empirical study involving five algorithms for SAT solving and AI planning, we show that neural networks predict the true RTDs of unseen instances better than previous methods, and can even do so when only few runtime observations are available per training instance.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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 simplification algorithms to improve to improve the efficiency of pipeline section design and alignment sheet mapping. Based on several classical curve simplification algorithms, the author proposed the automatic segmentation algorithm, which automatically adjusts the location of rectangular boxes according to the number of pipeline/circle intersection points and pipeline/ rectangular box intersection points. Finally, through comparing time and result with the traditional manual method, the author proved the algorithm’s effectiveness and feasibility.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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 mathematical functions with different dimensions. They are then applied to the optimization of DTMB Model 5415 for reduced drag. Two optimal hull forms are obtained by the ABC and the IABC algorithms. A large drag reduction is obtained by both of the algorithms. The optimal hull form obtained by the IABC algorithm has larger drag reduction than that of the hull form from the ABC algorithm. The results show that two ABC algorithms can be used for optimizing ship hull forms and the IABC algorithm has better performance than the ABC algorithm for the tested case in ship hull form optimization.
APA, Harvard, Vancouver, ISO, and other styles
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. Switzerland: Trans Tech Publications Ltd, 2023. http://dx.doi.org/10.4028/p-udj0cq.

Full text
Abstract:
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, and other styles

Reports on the topic "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, June 2021. http://dx.doi.org/10.46850/sofia.9783941627925.

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

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

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

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

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

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

Full text
Abstract:
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-driven decisions. The paper emphasizes the imperative for competition authorities to identify unusual market behaviors, hinting at shifting the burden of proof to firms with algorithmic pricing. Balancing algorithmic transparency and collusion prevention is crucial. While regulations might address these concerns, they could hinder algorithmic development. As this form of collusion becomes central in antitrust, understanding through models like bandit algorithms is vital, since these last ones may converge faster towards an anticompetitive equilibrium.
APA, Harvard, Vancouver, ISO, and other styles
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, June 2022. http://dx.doi.org/10.21079/11681/44523.

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

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

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

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

Full text
Abstract:
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, and other styles
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.

Full text
Abstract:
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 Aversion signifikant zurück.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL. The purpose of this paper is to develop a general approach for extending a tableau-based algorithm to a pinpointing algorithm. This approach is based on a general definition of „tableaux algorithms,' which captures many of the known tableau-based algorithms employed in DLs, but also other kinds of reasoning procedures.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Algorithm' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography