
	Where results make sense

Topic: List of algorithms

Related Topics

Quicksort

Strassen algorithm

Euclidean algorithm

Minimum spanning tree

Interpolation search

Binary search tree

Binary search

Smoothsort

Counting sort

Graham scan

Genetic algorithm

CYK algorithm

Bubble sort

List of terms relating to algorithms and data structures

Algorithm

	Algorithm - Wikipedia, the free encyclopedia
		The first case of an algorithm written for a computer was Ada Byron's notes on the analytical engine written in 1842, for which she is considered by many to be the world's first programmer.
		Algorithms are essential to the way computers process information, because a computer program is essentially an algorithm that tells the computer what specific steps to perform (in what specific order) in order to carry out a specified task, such as calculating employees’ paychecks or printing students’ report cards.
		Algorithms are implemented not only as computer programs, but often also by other means, such as in a biological neural network (for example, the human brain implementing arithmetic or an insect relocating food), in electric circuits, or in a mechanical device.
	en.wikipedia.org /wiki/Algorithm (3087 words)

	List of algorithms - Wikipedia, the free encyclopedia
		See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.
		Quicksort: divide list into two, with all items on the first list coming before all items on the second list.; then sort the two lists.
		Buddy memory allocation: Algorithm to allocate memory such that fragmentation is less.
	en.wikipedia.org /wiki/List_of_algorithms (1629 words)

	Search algorithm - Wikipedia, the free encyclopedia
		In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions.
		Brute-force search or "naïve"/uninformed search algorithms use the simplest, most intuitive method of searching through the search space, whereas informed search algorithms use heuristics to apply knowledge about the structure of the search space to try to reduce the amount of time spent searching.
		This is significantly better than linear search for large lists of data, but it requires that the list be sorted before searching (see sort algorithm) and also be random access.
	en.wikipedia.org /wiki/Search_algorithm (960 words)

	libstdc++: list Class Template Reference
		Note that the assignment completely changes the list and that the resulting list's size is the same as the number of elements assigned.
		Due to the nature of a list this operation can be done in constant time, and only invalidates iterators/references to the element being removed.
		If the number is smaller than the list's current size the list is truncated, otherwise the list is extended and new elements are populated with given data.
	gcc.gnu.org /onlinedocs/libstdc++/latest-doxygen/classstd_1_1list.html (1590 words)

	Algorithms
		All JGL algorithms are categorized and packaged as public static methods of a class that represents the category.
		This section lists all of the JGL algorithms by class, together with a brief synopsis.
		There are versions of the algorithm that modify the source container and others that copy the result into a separate container.
	www.cs.duke.edu /csl/docs/jgl/user/Algorithms.html (1385 words)

	comp.graphics.algorithms Frequently Asked Questions
		These algorithms may be recently proposed in published journals or papers, old or previously known algorithms, or hacks used incidental to the process of computer graphics.
		The scope of these algorithms may range from an efficient way to multiply matrices, all the way to a global illumination method incorporating raytracing, radiosity, infinite spectrum modeling, and perhaps even mirrored balls and lime jello.
		The marching cubes algorithm is used in volume rendering to construct an isosurface from a 3D field of values.
	www.faqs.org /faqs/graphics/algorithms-faq (14436 words)

	ALGORITHMS ANIMATOR Documentation
		The former is used to represent a Node in a List, in a Tree and in Graph.
		List algorithms act on self.list, tree algorithms act on self.tree and graph algorithms act on self.graph.
		The algorithm appends a new node in a Heap and restores the heap-property.
	condor.depaul.edu /~rjohnson/algorithm/csc321index.html (3176 words)

	Sorting Algorithms Demo
		This means that the algorithms do not allocate additional storage to hold temporary results: they sort the data in place.
		The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years.
		As the algorithms are explained, references to related algorithms and mathematical or experimental analyses are given.
	www.cs.ubc.ca /spider/harrison/Java/sorting-demo.html (527 words)

	REU: Algorithms for the List Update Problem, ALADDIN Center
		List update and paging problems are important problems in computer science.
		The goal of this project is to evaluate a known algorithm like Frequency Counting, both theoretically and experimentally against a semi-random adversary.
		The ideas from this could be used to propose an algorithm that covers the spectrum smoothly between average case and worst case bounds.
	www.aladdin.cs.cmu.edu /reu/mini_probes/2004/list_update.html (281 words)

	Geneseo CSci 141 List Algorithms
		List algorithms for test can be in terms of list messages
		Induction hypothesis: assume for list of size k-1, "delete(x)" deletes all occurences of x
		Show that in list of size k, "delete(x)" deletes all occurrences of x
	www.cs.geneseo.edu /~baldwin/csci141/spring2004/0325lists.html (186 words)

	List of Algorithms
		This single wikipedia webpage shows you a list of algorithms neatly classified into categories.
		A well known algorithm has stood the test of time, if you yourself tried to figure out an algorithm to solve a well known problem, the chances are that you wouldn't get it right, or it wouldn't be as efficient as the well known algorithm.
		This is quite slow and repeditive and would involve you going through the list many many times.
	digg.com /programming/List_of_Algorithms (549 words)

	List of algorithms (Site not responding. Last check: 2007-11-07)
		Bresenham's line algorithm: plots points of a 2-dimensional array to form a straight line between 2 specified points
		Fast Fourier transform: determines the frequencies contained in a (segment of a) signal
		CYK algorithm: decides whether a given string can be generated by a given context-free grammar
	www.uncover.us /en/wikipedia/l/li/list_of_algorithms.html (779 words)

	Chapter 7. Using Compression Library Algorithms
		The algorithm affects the data size and quality and the rate of compression and decompression, so it is important to consider how an algorithm might affect the end result and whether a particular algorithm achieves the desired effect.
		Querying algorithms, rather than having hard-coded setups, makes it possible to have an algorithm-independent interface, which lets you take advantage of future algorithms as they are implemented without redesigning your code.
		If the size of the algorithmTypeBuffer is smaller than the returned value, a partial list of the algorithms and their types is returned, and you must enlarge the algorithmTypeBuffer in order to receive a complete list.
	techpubs.sgi.com /library/dynaweb_docs/hdwr/SGI_Developer/books/OctComp_PG/sgi_html/ch07.html (1752 words)

	GDAlgorithms-list Info Page (Site not responding. Last check: 2007-11-07)
		This list is for discussion of algorithms and their implementation in games.
		In addition, there are a growing number of questions that could be solved with a simple web search through www.google.com or any of the major search engines, and the archives are also available as many of these questions have already been asked.
		This is a hidden list, which means that the members list is available only to the list administrator.
	lists.sourceforge.net /lists/listinfo/gdalgorithms-list (497 words)

	Visibility II: scanline, area, list priority algorithms (Site not responding. Last check: 2007-11-07)
		In other words, we are maintaining a list of active polygon "spans" for the current scanline, sorted by Z. The work required to maintain this list consists of inserting spans into it in proper Z-sorted position.
		At edge #4 above, when topmost polygon ABC stops, we remove its span from the list and revert to the color of the span which is then topmost on the list, DEF in this case.
		Since the order of spans cannot change except at these edges (including interpenetration edges, if any), there is never a need to resort the list.
	graphics.stanford.edu /courses/cs248-04/hidsurf/hidsurf2.html (123 words)

	List Viterbi Algorithms for Continuous Transmission
		However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
		The conventional list Viterbi algorithm (LVA) produces a list of the L best output sequences over a certain block length in decoding a terminated convolutional code.
		We show in this paper that the LVA with a sufficiently long list is an optimum maximum-likelihood decoder for the concatenated pair of a convolutional code and a cyclic redundancy check (CRC) block code with error detection.
	www.comsoc.org /comm/private/2001/may/784_49comm05-bchen.html (712 words)

	RIOT-The Scheduling Problem
		This list is made according to a random permutation.
		This algorithm is a heuristic used for finding the minimum makespan of a schedule.
		The algorithm outputs an order of jobs that is to be implemented on all machines.
	riot.ieor.berkeley.edu /riot/Applications/Scheduling/algorithms.html (710 words)

	Technorati Tag: algorithms
		Algorithm Books and More Shop eBay for anything and everything - from specialized gifts to custom clothing.
		Algorithmics: In-depth Company Info Go to Hoover's for in-depth, first-hand, company coverage provided by business experts.
		Algorithms for algorithms The future of software is in algorithms.
	www.technorati.com /tag/algorithms (457 words)

	The Complete Collection of Algorithm Animations (Site not responding. Last check: 2007-11-07)
		The Complete Collection of Algorithm Animations (CCAA) is a comprehensive collection of links to all of the algorithm animations that can be run over the Internet.
		The links are organized according to the algorithm categories on navigation bar.
		The CCAA not only provide a list of algorithms found on the sites, it also provides an overview of the algorithms that can be found on the associated links.
	www.cs.hope.edu /~alganim/ccaa (138 words)

	CS 330: Algorithms - mailing list (Site not responding. Last check: 2007-11-07)
		The course mailing list is named cs330 and is managed by IT's majordomo engine.
		Anyone who has registered for the course should add themselves mailing list.
		Students are welcome to post messages and questions to the mailing list.
	www.cs.bu.edu /~steng/teaching/Fall2003/mailinglist.html (78 words)

	Cone-Based Clustering Heuristic for List-Scheduling Algorithms (Site not responding. Last check: 2007-11-07)
		List scheduling algorithms attempt to minimize latency under resource constraints using a priority list.
		Based on this heuristic we have presented a new Cone-Based List Scheduling (CBLS) algorithm.
		Finally, we show that CBLS with the simple priority function performs better in execution time as well as latency when compared to the original FDLS that has a relatively complex priority function.
	www.ececs.uc.edu /~ddel/projects/dss/camera/camera.html (182 words)

	Run II Software Algorithms
		The Software Algorithms group is responsible for developing all "algorithms" used within the experiment.
		If you are interested in contributing to this effort, please contact one of the Algorithms group leaders or talk to your Physics group conveners.
		Level 3 (p16) has been certified for use in the V13 trigger list.
	www-d0.fnal.gov /computing/algorithms (1061 words)

	Data Structures & Algorithms 1 : List Data Structure
		Returns true or false, depending on whether the list is empty or not.
		This returns the size of the list - an integer.
		Stanadard method for returning the list's info as a string.
	www.cee.hw.ac.uk /flex/BScCS/ds1/topic9.html (138 words)

	ELECTRONIC FORUMS AND OTHER EC-RELATED ACTIVITIES (Site not responding. Last check: 2007-11-07)
		The list of events has been compiled by William M. Spears, and will be updated periodically.
		The 1998 Foundations of Genetic Algorithms (FOGA5) workshop will be the fifth biennial meeting of a workshop that was originally conceived as a way of exploring and focusing on theoretical issues relating to genetic algorithms (GAs), evolution strategies, and the field of evolutionary computation in general.
		Examples are evolutionary algorithms inspired by the processes of genetic inheritance and natural selection in biology, simulated annealing inspired by many-particle systems in physics, algorithms inspired by growth processes in biology and economics and neural and immune networks inspired by multi-cellular systems in biology and chemistry.
	www.aic.nrl.navy.mil /galist/info/conferences/CONFERENCES.html (3105 words)

	The Genetic Algorithms Archive (Site not responding. Last check: 2007-11-07)
		The Genetic Algorithms Archive is a repository for information related to research in genetic algorithms and other forms of evolutionary computation.
		Sushil J. Louis, conducts work on combining genetic algorithms with associative memories (case-based memory and sparse distributed memory) for learning to improve performance at a set of related tasks.
		The Hellenic Complex Systems Laboratory is an independent, non-profit, research laboratory that has invented the genetic algorithms based design of optimal QC and has proposed the definition of the entropy during the genetic search.
	www.aic.nrl.navy.mil /galist (2372 words)

	Profile Scheduling by List Algorithms - Liu, Sanlaville (ResearchIndex) (Site not responding. Last check: 2007-11-07)
		Abstract: : The notion of profile scheduling was first introduced by Ullman in 1975 in the complexity analysis of deterministic scheduling algorithms.
		In such a model, the number of processors available to a set of tasks may vary in time.
		Liu, E. Sanlaville, "Profile Scheduling by List Algorithms." In Scheduling Theory and Its Applications, P. Chretienne et al.
	citeseer.ist.psu.edu /237186.html (409 words)

	List Crypto Algorithms (Site not responding. Last check: 2007-11-07)
		The application listalgs.exe is a native win32 console application, compiled with VC++ 6, that lists the supported cryptographic algorithms for the cryptographic provider type PROV_RSA_FULL.
		Algorithms are listed for both the MS_DEF_PROV (BASE) and the MS_ENHANCED_PROV CSP providers.
		The utility displays the bit-size of the key, algorithm type (Encrypt, Hash, Signature, Exchange) and the algorithm name.
	www.jensign.com /JavaScience/ListAlgs (64 words)

	Objective Function Selection for List Scheduling (Site not responding. Last check: 2007-11-07)
		In this paper we discuss the choice of objective function in list scheduling algorithms for scheduling data flow graphs onto multiprocessor architectures.
		A majority of the list scheduling algorithms used in practice utilize a global strategy wherein actor static levels are used for making scheduling decisions.
		When fine-grain DSP applications such as FIR or elliptical filters need to be scheduled on architectures that consist of commodity part processors and a general interconnection network whose interprocessor communication cost cannot be ignored, a traditional list scheduling algorithm is in many cases not the best choice.
	www.ce.chalmers.se /~janjo/Papers/Articles/icassp97.html (211 words)

	GA Group Publications List (Site not responding. Last check: 2007-11-07)
		The Role of Mutation and Recombination Evolutionary Algorithms Ph.D. thesis, George Mason University, Fairfax, VA, 1998.
		A Formal Analysis of the Role of Multi-Point Crossover in Genetic Algorithms.
		An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms.
	www.cs.gmu.edu /research/gag/pubs.html (1704 words)

Try your search on: Qwika (all wikis)