Bibliografias temáticas / Algorithm

Índice

Artigos de revistas
Teses / dissertações
Livros
Capítulos de livros
Trabalhos de conferências
Relatórios de organizações

Literatura científica selecionada sobre o tema "Algorithm"

Autor: Grafiati

Publicado: 4 de junho de 2021

Última modificação: 22 de junho de 2024

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Algorithm".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Artigos de revistas sobre o assunto "Algorithm"

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 (30 de junho de 2017): 614–21. http://dx.doi.org/10.31142/ijtsrd2197.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Okazaki, Hiroyuki, Yosiki Aoki e Yasunari Shidama. "Extended Euclidean Algorithm and CRT Algorithm". Formalized Mathematics 20, n.º 2 (1 de dezembro de 2012): 175–79. http://dx.doi.org/10.2478/v10037-012-0020-2.

Texto completo da fonte

Resumo:

Summary In this article we formalize some number theoretical algorithms, Euclidean Algorithm and Extended Euclidean Algorithm [9]. Besides the a gcd b, Extended Euclidean Algorithm can calculate a pair of two integers (x, y) that holds ax + by = a gcd b. In addition, we formalize an algorithm that can compute a solution of the Chinese remainder theorem by using Extended Euclidean Algorithm. Our aim is to support the implementation of number theoretic tools. Our formalization of those algorithms is based on the source code of the NZMATH, a number theory oriented calculation system developed by Tokyo Metropolitan University [8].

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Beth, T., e D. Gollman. "Algorithm engineering for public key algorithms". IEEE Journal on Selected Areas in Communications 7, n.º 4 (maio de 1989): 458–66. http://dx.doi.org/10.1109/49.17708.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Kulkarni, Anuj, Saish Padave, Satyam Shrivastava e Mrs Vidya Kawtikwar. "Algorithm Visualizer". International Journal for Research in Applied Science and Engineering Technology 11, n.º 7 (31 de julho de 2023): 1818–23. http://dx.doi.org/10.22214/ijraset.2023.54837.

Texto completo da fonte

Resumo:

Abstract: In recent years, computer science education has become increasingly important as technology continues to play a dominant role in our lives. The understanding of algorithms and their implementation is a crucial aspect of computer science education. Visualizing algorithms can be a powerful tool to help students understand and retain the concepts behind them. This paper presents a new algorithm visualizer that focuses on two main types of algorithms: sorting algorithms and graph pathfinding algorithms. The algorithm visualizer was created using React.js, a popular JavaScript library, and provides visualizations for various sorting algorithms, such as merge sort, quick sort, heap sort, and bubble sort. Additionally, the visualizer includes visualizations for graph pathfinding algorithms such as breadth-first search, depth-first search, and A*. The visualizer also includes mazes and patterns that can be solved using the pathfinding algorithms, allowing users to see the algorithms in action. The algorithm visualizer provides a user-friendly interface that allows users to step through the algorithms and see how they work. This interactive approach to learning algorithms provides a valuable resource for students and educators alike. The visualizer is also highly customizable, allowing users to adjust the speed and complexity of the algorithms to fit their needs. This paper provides a comprehensive overview of the design, implementation, and evaluation of the algorithm visualizer.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mais fontes

Teses / dissertações sobre o assunto "Algorithm"

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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.

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

Mestrado em Decisão Económica e Empresarial
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.
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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
Includes bibliographical references (p. 71-72).
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.
by Pramook Khungurn.
M.Eng.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Johansson, Björn, e 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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

Čá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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Rafique, Abid. "Communication optimization in iterative numerical algorithms : an algorithm-architecture interaction". Thesis, Imperial College London, 2014. http://hdl.handle.net/10044/1/17837.

Texto completo da fonte

Resumo:

Trading communication with redundant computation can increase the silicon efficiency of common hardware accelerators like FPGA and GPU in accelerating sparse iterative numerical algorithms. While iterative numerical algorithms are extensively used in solving large-scale sparse linear system of equations and eigenvalue problems, they are challenging to accelerate as they spend most of their time in communication-bound operations, like sparse matrix-vector multiply (SpMV) and vector-vector operations. Communication is used in a general sense to mean moving the matrix and the vectors within the custom memory hierarchy of the FPGA and between processors in the GPU; the cost of which is much higher than performing the actual computation due to technological reasons. Additionally, the dependency between the operations hinders overlapping computation with communication. As a result, although GPU and FPGA are offering large peak floating-point performance, their sustained performance is nonetheless very low due to high communication costs leading to poor silicon efficiency. In this thesis, we provide a systematic study to minimize the communication cost thereby increase the silicon efficiency. For small-to-medium datasets, we exploit large on-chip memory of the FPGA to load the matrix only once and then use explicit blocking to perform all iterations at the communication cost of a single iteration. For large sparse datasets, it is now a well-known idea to unroll k iterations using a matrix powers kernel which replaces SpMV and two additional kernels, TSQR and BGS, which replace vector-vector operations. While this approach can provide a Θ(k) reduction in the communication cost, the extent of the unrolling depends on the growth in redundant computation, the underlying architecture and the memory model. In this work, we show how to select the unroll factor k in an architecture-agnostic manner to provide communication-computation tradeoff on FPGA and GPU. To this end, we exploit inverse-memory hierarchy of the GPUs to map matrix power kernel and present a new algorithm for the FPGAs which matches with their strength to reduce redundant computation to allow large k and hence higher speedups. We provide predictive models of the matrix powers kernel to understand the communication-computation tradeoff on GPU and FPGA. We highlight extremely low efficiency of the GPU in TSQR due to off-chip sharing of data across different building blocks and show how we can use on-chip memory of the FPGA to eliminate this off-chip access and hence achieve better efficiency. Finally, we demonstrate how to compose all the kernels by using a unified architecture and exploit on-chip memory of the FPGA to share data across these kernels. Using the Lanczos Iteration as a case study to solve symmetric extremal eigenvalue problem, we show that the efficiency of FPGAs can be increased from 1.8% to 38% for small- to-medium scale dense matrices whereas up to 7.8% for large-scale structured banded matrices. We show that although GPU shows better efficiency for certain kernels like the matrix powers kernel, the overall efficiency is even lower due to increase in communication cost while sharing data across different kernels through off-chip memory. As the Lanczos Iteration is at the heart of all modern iterative numerical algorithms, our results are applicable to a broad class of iterative numerical algorithms.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mais fontes

Livros sobre o assunto "Algorithm"

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mais fontes

Capítulos de livros sobre o assunto "Algorithm"

Bez, Helmut, e 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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Bansal, Jagdish Chand, Prathu Bajpai, Anjali Rawat e Atulya K. Nagar. "Conclusion and Further Research Directions". In Sine Cosine Algorithm for Optimization, 105–6. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-9722-8_6.

Texto completo da fonte

Resumo:

AbstractThe increasing complexity of real-world optimization problems demands fast, robust, and efficient meta-heuristic algorithms. The popularity of these intelligent techniques is gaining popularity day by day among researchers from various disciplines of science and engineering. The sine cosine algorithm is a simple population-based stochastic approach for handling different optimization problems. In this work, we have discussed the basic sine cosine algorithm for continuous optimization problems, the multi-objective sine cosine algorithm for handling multi-objective optimization problems, and the discrete (or binary) versions of sine cosine algorithm for discrete optimization problems. Sine cosine algorithm (SCA) has reportedly shown competitive results when compared to other meta-heuristic algorithms. The easy implementation and less number of parameters make the SCA algorithm, a recommended choice for performing various optimization tasks. In this present chapter, we have studied different modifications and strategies for the advancement of the sine cosine algorithm. The incorporation of concepts like opposition-based learning, quantum simulation, and hybridization with other meta-heuristic algorithms have increased the efficiency and robustness of the SCA algorithm, and meanwhile, these techniques have also increased the application spectrum of the sine cosine algorithm.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Bansal, Jagdish Chand, Prathu Bajpai, Anjali Rawat e Atulya K. Nagar. "Sine Cosine Algorithm". In Sine Cosine Algorithm for Optimization, 15–33. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-9722-8_2.

Texto completo da fonte

Resumo:

AbstractSine cosine algorithm (SCA) [1] is relatively a new algorithm, in the field of meta-heuristic algorithms. SCA is a population-based probabilistic search method that updates the position of search agents in the population using simple concept of trigonometric functions sine and cosine. SCA algorithm is inspired from the periodic property of the sine and cosine functions. The periodicity of the sine and cosine function in the range $$[-1,1]$$ provides great capacity to exploit the search space and helps in maintaining a fine balance between exploration and exploitation. In previous Chap. 1, we have already discussed about the criticality of the exploration and exploitation capabilities of any meta-heuristic algorithm.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Taillard, Éric D. "Elements of Graphs and Complexity Theory". In Design of Heuristic Algorithms for Hard Optimization, 3–29. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13714-3_1.

Texto completo da fonte

Resumo:

AbstractThis chapter recalls some elements and definitions in graph theory and complexity theory. On the one hand, basic algorithmic courses very often include graph algorithms. Some of these algorithms have simply been transposed to solve difficult optimization problems in a heuristic way. On the other hand, it is important to be able to determine whether a problem falls into the category of difficult problems. Indeed, one will not develop a heuristic algorithm if there is an efficient algorithm to find an exact solution. Another objective of this chapter is to make the book self-contained.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Shekhar, Shashi, e 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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Gass, Saul I., e 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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Gass, Saul I., e 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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Gass, Saul I., e 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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Gass, Saul I., e 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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "Algorithm"

Borjesson, Fredrik, e 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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

El-Mihoub, Tarek A., Christoph Tholen e 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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Eggensperger, Katharina, Marius Lindauer e 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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Guo, Lei, Lijian Zhou, Shaohui Jia, Li Yi, Haichong Yu e 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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Huang, Fuxin, Lijue Wang e 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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Murukesh, Aadhithya, e 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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

Jesus, Alexandre D., Arnaud Liefooghe, Bilel Derbel e Luís Paquete. "Algorithm selection of anytime algorithms". In GECCO '20: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3377930.3390185.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Knobloch, Roman, e Jaroslav Mlynek. "Differential Evolution Algorithm In Models Of Technical Optimization". In 35th ECMS International Conference on Modelling and Simulation. ECMS, 2021. http://dx.doi.org/10.7148/2021-0179.

Texto completo da fonte

Resumo:

At present, evolutionary optimization algorithms are increasingly used in the development of new technological processes. Evolutionary algorithms often allow the optimization procedure to be performed even in cases where classical optimization algorithms fail (e.g. gradient methods) and where an acceptable solution is sufficient to solve the optimization task. The article focuses on possibilities of using a differential evolution algorithm in the optimization process. This algorithm is often referred to in the literature as a global optimization procedure. However, we show by means of a practical example that the convergence of the classic differential algorithm to the global extreme is not generally assured and is largely dependent on the specific cost function. To remove this weakness, we designed a modified version of the differential evolution algorithm. The improved version, named the modified differential evolution algorithm, is described in the article. It is possible to prove asymptotic convergence to the global minimum of the cost function for the modified version of the algorithm.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Relatórios de organizações sobre o assunto "Algorithm"

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

Texto completo da fonte

Resumo:

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 & 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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Johansen, Richard A., Christina L. Saltus, Molly K. Reif e 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, junho de 2022. http://dx.doi.org/10.21079/11681/44523.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!