Log in

Relevant bibliographies by topics / Computer algorithms

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Computer algorithms'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 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 'Computer algorithms.'

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 "Computer algorithms"

1

Pinkan Indriani Daulay and Yahfizham Yahfizham. "Penerapan Algoritma Pemrograman dalam Pembelajaran Ilmu Komputer." Jurnal Arjuna : Publikasi Ilmu Pendidikan, Bahasa dan Matematika 1, no. 6 (2023): 91–103. http://dx.doi.org/10.61132/arjuna.v1i6.297.

Full text

Abstract:

Algorithms are at the core of computer science and play an important role in computer programming. Programming aims to tell the computer to perform certain functions. Computer instructions provide a set of instructions written in a language that the computer can understand. Programming algorithms consist of various detailed sequential steps aimed at solving various computer programming problems. A computer is an electronic device capable of receiving, processing, storing and creating information. In general, a computer is a machine that is used to perform various tasks, such as data processing

APA, Harvard, Vancouver, ISO, and other styles

2

Mitra, Manu. "Algorithms in Computer Systems." Frontiers of Supercomputing 2, no. 2 (2019): 1–3. https://doi.org/10.31424/icses.fos.

Full text

Abstract:

Basic definition of algorithm in mathematics is step by step procedure to solve a problem. Algorithms are basic and most important area in a writing an error free programs. Fig. 1 illustrates flow chart of a computer algorithm. One of the most essential thing to remember is that there can be various algorithms for the same problem but some algorithms are much better than others. Technically, algorithm and programs are actually not the same thing, they differ at the level of precision. It is often expressed loosely defined format called “pseudo code” which matches programming langua

APA, Harvard, Vancouver, ISO, and other styles

3

Xu, Zheng Guang, Chen Chen, and Xu Hong Liu. "An Efficient View-Point Invariant Detector and Descriptor." Advanced Materials Research 659 (January 2013): 143–48. http://dx.doi.org/10.4028/www.scientific.net/amr.659.143.

Full text

Abstract:

Many computer vision applications need keypoint correspondence between images under different view conditions. Generally speaking, traditional algorithms target applications with either good performance in invariance to affine transformation or speed of computation. Nowadays, the widely usage of computer vision algorithms on handle devices such as mobile phones and embedded devices with low memory and computation capability has proposed a target of making descriptors faster to computer and more compact while remaining robust to affine transformation and noise. To best address the whole process

APA, Harvard, Vancouver, ISO, and other styles

4

Mitra, Manu. "Algorithms and Machine Learning." American Research Journal of Electronics and Communication Engineering 1, no. 1 (2019): 1–5. https://doi.org/10.5281/zenodo.3479371.

Full text

Abstract:

Machine learning is a model that learns patterns in data and then calculates similar patterns in new data. For instance, if you want to categorize children’s books, it would mean that instead of setting up exact instructions for what establishes a children’s books, experts can set the computer hundreds of examples of children’s books. Then the computer find the pattern in that books and uses that pattern to recognize future books in that particular category. However, Machine Learning is actually a subset of artificial intelligence that assists computers to learn without expli

APA, Harvard, Vancouver, ISO, and other styles

5

Jattana, Manpreet Singh. "Quantum annealer accelerates the variational quantum eigensolver in a triple-hybrid algorithm." Physica Scripta 99, no. 9 (2024): 095117. http://dx.doi.org/10.1088/1402-4896/ad6aea.

Full text

Abstract:

Abstract Hybrid algorithms that combine quantum and classical resources have become commonplace in quantum computing. The variational quantum eigensolver (VQE) is routinely used to solve prototype problems. Currently, hybrid algorithms use no more than one kind of quantum computer connected to a classical computer. In this work, a novel triple-hybrid algorithm combines the effective use of a classical computer, a gate-based quantum computer, and a quantum annealer. The solution of a graph coloring problem found using a quantum annealer reduces the resources needed from a gate-based quantum com

APA, Harvard, Vancouver, ISO, and other styles

6

Ataeva, Gulsina Isroilovna, and Lola Dzhalolovna Yodgorova. "METHODS AND ALGORITHMS OF COMPUTER GRAPHICS." Scientific Reports of Bukhara State University 4, no. 1 (2020): 43–47. http://dx.doi.org/10.52297/2181-1466/2020/4/1/3.

Full text

Abstract:

Methods and algorithms of computer graphics are considered in the article. Implementation of transformation of graphic objects by means of operations of transfer, scaling, rotation, the types of geometric models are considered. Methods of computer graphics include methods of converting graphic objects, representing (scanning) lines in raster form, selecting a window, removing hidden lines, projecting, painting images.

APA, Harvard, Vancouver, ISO, and other styles

7

Cropper, Andrew. "The Automatic Computer Scientist." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 13 (2023): 15434. http://dx.doi.org/10.1609/aaai.v37i13.26801.

Full text

Abstract:

Algorithms are ubiquitous: they track our sleep, help us find cheap flights, and even help us see black holes. However, designing novel algorithms is extremely difficult, and we do not have efficient algorithms for many fundamental problems. The goal of my research is to accelerate algorithm discovery by building an automatic computer scientist. To work towards this goal, my research focuses on inductive logic programming, a form of machine learning in which my collaborators and I have demonstrated major advances in automated algorithm discovery over the past five years. In this talk and paper

APA, Harvard, Vancouver, ISO, and other styles

8

Moosakhah, Fatemeh, and Amir Massoud Bidgoli. "Congestion Control in Computer Networks with a New Hybrid Intelligent Algorithm." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 13, no. 8 (2014): 4688–706. http://dx.doi.org/10.24297/ijct.v13i8.7068.

Full text

Abstract:

With invention of computer networks, transferring data from one computer to another became possible, but as the number of computers that transfer data to each other increased and common communication channel bandwidth among them in a network limited, has led to a phenomenon called congestion, so that some of data packets would be dropped and never arrive to destination. Different algorithms have been proposed for overcoming congestion. These are divided into two general groups: 1- flow based algorithms and 2- class based algorithms. In present study, using class based algorithm with optimizati

APA, Harvard, Vancouver, ISO, and other styles

9

Handayani, Dwipa, and Abrar Hiswara. "KAMUS ISTILAH ILMU KOMPUTER DENGAN ALGORITMA BOYER MOORE BERBASIS WEB." Jurnal Informatika 19, no. 2 (2019): 90–97. http://dx.doi.org/10.30873/ji.v19i2.1519.

Full text

Abstract:

A dictionary is a reference book that contains words and phrases that are usually arranged in alphabetical order along with an explanation of their meaning, usage and translation and function to help recognize new terms. The field of computer science certainly has specific terms related to computers, so it is needed a dictionary of computer terms, currently the existing dictionary is still conventional in its use ineffective and inefficient. The design and manufacture of applications using algorithms by performing a sequence of logical steps in solving problems that are arranged systematically

APA, Harvard, Vancouver, ISO, and other styles

10

Pelter, Michele M., and Mary G. Carey. "ECG Computer Algorithms." American Journal of Critical Care 17, no. 6 (2008): 581–82. http://dx.doi.org/10.4037/ajcc2008.17.6.581.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Computer algorithms"

1

Mosca, Michele. "Quantum computer algorithms." Thesis, University of Oxford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.301184.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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 pro

APA, Harvard, Vancouver, ISO, and other styles

3

Rhodes, Daniel Thomas. "Hardware accelerated computer graphics algorithms." Thesis, Nottingham Trent University, 2008. http://irep.ntu.ac.uk/id/eprint/201/.

Full text

Abstract:

The advent of shaders in the latest generations of graphics hardware, which has made consumer level graphics hardware partially programmable, makes now an ideal time to investigate new graphical techniques and algorithms as well as attempting to improve upon existing ones. This work looks at areas of current interest within the graphics community such as Texture Filtering, Bump Mapping and Depth of Field simulation. These are all areas which have enjoyed much interest over the history of computer graphics but which provide a great deal of scope for further investigation in the light of recent

APA, Harvard, Vancouver, ISO, and other styles

4

Mims, Mark McGrew. "Dynamical stability of quantum algorithms /." Full text (PDF) from UMI/Dissertation Abstracts International, 2000. http://wwwlib.umi.com/cr/utexas/fullcit?p3004342.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Li, Quan Ph D. Massachusetts Institute of Technology. "Algorithms and algorithmic obstacles for probabilistic combinatorial structures." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/115765.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 209-214).<br>We study efficient average-case (approximation) algorithms for combinatorial optimization problems, as well as explore the algorithmic obstacles for a variety of discrete optimization problems arising in the theory of random graphs, statistics and machine learning. In particular, we consider the average-case optimization for three NP-hard combinatorial optimization problems: La

APA, Harvard, Vancouver, ISO, and other styles

6

Tran, Chan-Hung. "Fast clipping algorithms for computer graphics." Thesis, University of British Columbia, 1986. http://hdl.handle.net/2429/26336.

Full text

Abstract:

Interactive computer graphics allow achieving a high bandwidth man-machine communication only if the graphics system meets certain speed requirements. Clipping plays an important role in the viewing process, as well as in the functions zooming and panning; thus, it is desirable to develop a fast clipper. In this thesis, the intersection problem of a line segment against a convex polygonal object has been studied. Adaption of the the clip algorithms for parallel processing has also been investigated. Based on the conventional parametric clipping algorithm, two families of 2-D generalized line

APA, Harvard, Vancouver, ISO, and other styles

7

Viloria, John A. (John Alexander) 1978. "Optimizing clustering algorithms for computer vision." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86847.

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

APA, Harvard, Vancouver, ISO, and other styles

9

O'Brien, Neil. "Algorithms for scientific computing." Thesis, University of Southampton, 2012. https://eprints.soton.ac.uk/355716/.

Full text

Abstract:

There has long been interest in algorithms for simulating physical systems. We are concernedwith two areaswithin this field: fastmultipolemethods andmeshlessmethods. Since Greengard and Rokhlin’s seminal paper in 1987, considerable interest has arisen in fast multipole methods for finding the energy of particle systems in two and three dimensions, and more recently in many other applications where fast matrix-vector multiplication is called for. We develop a new fast multipole method that allows the calculation of the energy of a system of N particles in O(N) time, where the particles’ interac

APA, Harvard, Vancouver, ISO, and other styles

10

Nofal, Samer. "Algorithms for argument systems." Thesis, University of Liverpool, 2013. http://livrepository.liverpool.ac.uk/12173/.

Full text

Abstract:

Argument systems are computational models that enable an artificial intelligent agent to reason via argumentation. Basically, the computations in argument systems can be viewed as search problems. In general, for a wide range of such problems existing algorithms lack five important features. Firstly, there is no comprehensive study that shows which algorithm among existing others is the most efficient in solving a particular problem. Secondly, there is no work that establishes the use of cost-effective heuristics leading to more efficient algorithms. Thirdly, mechanisms for pruning the search

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Computer algorithms"

1

Horowitz, Ellis. Computer algorithms. 2nd ed. Silicon Press, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Horowitz, Ellis. Computer algorithms. Computer Science Press, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Horowitz, Ellis. Computer algorithms. 2nd ed. Silicon Press, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Horowitz, Ellis. Computer algorithms. 2nd ed. Silicon Press, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Horowitz, Ellis. Computer algorithms. 2nd ed. Silicon Press, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Horowitz, Ellis. Computer algorithms. Computer Science Press, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Baase, Sara. Computer algorithms: Introduction to design and analysis. 2nd ed. Addison-Wesley Pub. Co., 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Baase, Sara. Computer algorithms: Introduction to design and analysis. 2nd ed. Addison-Wesley Pub. Co., 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Salander, Elisabeth C., and Elisabeth C. Salander. Computer search algorithms. Nova Science Publishers, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Horowitz, Ellis. Computer algorithms/C++. 2nd ed. Silicon Press, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Computer algorithms"

1

Phan, Vinhthuy. "Algorithms, Computer." In Encyclopedia of Sciences and Religions. Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-1-4020-8265-8_1476.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Zobel, Justin. "Algorithms." In Writing for Computer Science. Springer London, 2004. http://dx.doi.org/10.1007/978-0-85729-422-7_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zobel, Justin. "Algorithms." In Writing for Computer Science. Springer London, 2014. http://dx.doi.org/10.1007/978-1-4471-6639-9_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lim, Daniel. "Algorithms." In Philosophy through Computer Science. Routledge, 2023. http://dx.doi.org/10.4324/9781003271284-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Baratz, Alan, Inder Gopal, and Adrian Segall. "Fault tolerant queries in computer networks." In Distributed Algorithms. Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/bfb0019792.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Roosta, Seyed H. "Computer Architecture." In Parallel Processing and Parallel Algorithms. Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4612-1220-1_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mehlhorn, Kurt. "The Physarum Computer." In WALCOM: Algorithms and Computation. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19094-0_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Deshpande, Amar H., Shilpa S. Borkar, and Jagdish R. Baheti. "Medical Computer Vision." In Algorithms for Intelligent Systems. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-3648-8_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Erciyes, K. "Algorithms." In Undergraduate Topics in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61115-6_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Sutinen, Erkki, and Matti Tedre. "ICT4D: A Computer Science Perspective." In Algorithms and Applications. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12476-1_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Computer algorithms"

1

Kou, Yanying, Jinlong Chen, Ke Huang, and Jiatao Xiong. "Face Detection in Computer Vision: A Comprehensive Review." In 2025 8th International Conference on Advanced Algorithms and Control Engineering (ICAACE). IEEE, 2025. https://doi.org/10.1109/icaace65325.2025.11019031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Jin, Hulin, Zhiran Jin, Yong-Guk Kim, Yutong Zhou, and Yueda Li. "Reinforcement Learning-Driven Feedback Optimisation Algorithms for Brain-Computer Interfaces." In 2025 8th International Conference on Advanced Algorithms and Control Engineering (ICAACE). IEEE, 2025. https://doi.org/10.1109/icaace65325.2025.11019571.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zhang, Yi, Jie Qiu, and Guangqiang Wu. "Computer Vision Kinematic Detection of Centrifugal Pendulum Vibration Absorber." In 2025 4th Asia Conference on Algorithms, Computing and Machine Learning (CACML). IEEE, 2025. https://doi.org/10.1109/cacml64929.2025.11010954.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Efimov, Aleksey Igorevich, and Dmitry Igorevich Ustukov. "Comparative Analysis of Stereo Vision Algorithms Implementation on Various Architectures." In 32nd International Conference on Computer Graphics and Vision. Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/graphicon-2022-484-489.

Full text

Abstract:

A comparative analysis of the functionality of stereo vision algorithms on various hardware architectures has been carried out. The quantitative results of stereo vision algorithms implementation are presented, taking into account the specifics of the applied hardware base. The description of the original algorithm for calculating the depth map using the summed-area table is given. The complexity of the algorithm does not depend on the size of the search window. The article presents the content and results of the implementation of the stereo vision method on standard architecture computers, in

APA, Harvard, Vancouver, ISO, and other styles

5

Spector, Lee. "Evolving quantum computer algorithms." In the 11th annual conference companion. ACM Press, 2009. http://dx.doi.org/10.1145/1570256.1570420.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Spector, Lee. "Evolving quantum computer algorithms." In the 13th annual conference companion. ACM Press, 2011. http://dx.doi.org/10.1145/2001858.2002128.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Milne, Darran. "Computer-Generated Holography Algorithms." In Frontiers in Optics. Optica Publishing Group, 2023. http://dx.doi.org/10.1364/fio.2023.fm1a.4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Czakoova, Krisztina. "DEVELOPING ALGORITHMIC THINKING BY EDUCATIONAL COMPUTER GAMES." In eLSE 2020. University Publishing House, 2020. http://dx.doi.org/10.12753/2066-026x-20-003.

Full text

Abstract:

Basics of algorithmic thinking should not be limited to create right solutions and express them by a computer program, but should also be used a suitable methodology based on problem solving, preferably in a playful way. In many cases at school most of the learners consider the topic of algorithms as hard and not very attractive. For beginners in programming the knowledge of specific algorithms is not so important. The ability to understand principles of algorithms, as well as to find own algorithms for new problems are more desirable. One main educational objective is to know that an algorith

APA, Harvard, Vancouver, ISO, and other styles

9

Kosovskaya, Tatiana, та Juan Zhou. "Algorithms for Checking Isomorphism of Two Elementary Conjunctiоns". У Computer Science and Information Technologies 2023. Institute for Informatics and Automation Problems, 2023. http://dx.doi.org/10.51408/csit2023_01.

Full text

Abstract:

When solving AI problems related to the study of complex structured objects, a convenient tool for describing such objects is the predicate calculus language. The paper presents two algorithms for checking two elementary conjunctions of predicate formulas for isomorphism (matches up to the names of variables and the order of conjunctive terms). The first of the algorithms checks for isomorphism elementary conjunctions containing a single predicate symbol. In addition, if the formulas are isomorphic, then it finds a one-to-one correspondence between the arguments of these formulas. If all predi

APA, Harvard, Vancouver, ISO, and other styles

10

Freeman, William T. "Where computer vision needs help from computer science." In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2011. http://dx.doi.org/10.1137/1.9781611973082.64.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Computer algorithms"

1

Poggio, Tomaso, and James Little. Parallel Algorithms for Computer Vision. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada203947.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Leach, Ronald J. Analysis of Blending Algorithms in Computer Graphics. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada201921.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Dixon, L. C., and R. C. Price. Optimisation Algorithms for Highly Parallel Computer Architectures. Defense Technical Information Center, 1990. http://dx.doi.org/10.21236/ada235911.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Leach, Ronald J. Analysis of Blending Algorithms in Computer Graphics. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada244279.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kupinski, Matthew A. Investigation of Genetic Algorithms for Computer-Aided Diagnosis. Defense Technical Information Center, 2000. http://dx.doi.org/10.21236/ada393995.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Schnabel, R. Concurrent Algorithms for Numerical Computation on Hypercube Computer. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada195502.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kupinski, Matthew A. Investigation of Genetic Algorithms for Computer-Aided Diagnosis. Defense Technical Information Center, 1999. http://dx.doi.org/10.21236/ada391457.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

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

APA, Harvard, Vancouver, ISO, and other styles

9

Varastehpour, Soheil, Hamid Sharifzadeh, and Iman Ardekani. A Comprehensive Review of Deep Learning Algorithms. Unitec ePress, 2021. http://dx.doi.org/10.34074/ocds.092.

Full text

Abstract:

Deep learning algorithms are a subset of machine learning algorithms that aim to explore several levels of the distributed representations from the input data. Recently, many deep learning algorithms have been proposed to solve traditional artificial intelligence problems. In this review paper, some of the up-to-date algorithms of this topic in the field of computer vision and image processing are reviewed. Following this, a brief overview of several different deep learning methods and their recent developments are discussed.

APA, Harvard, Vancouver, ISO, and other styles

10

Ainsworth, James S., and Steven Kubala. Computer Simulation Modeling: A Method for Predicting the Utilities of Alternative Computer-Aided Treat Evaluation Algorithms. Defense Technical Information Center, 1990. http://dx.doi.org/10.21236/ada230252.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!