Links to Computer Algorithms
Lijia Xu
CMSC 641
Fall 1998
Assignment 3
Problem 3
Algorithm animation
-
JAVA animations of
five sorting algorithms.
-
Zeus And Algorithm
Animation at SRC - Algorithm animation is a type of program visualization
that is primarily concerned with displaying the workings of computer algorithms.
This page gives you access to the work that we have been doing at Digital
Equipment Corporation's Systems Research Center in this area.
-
Arts:
Visual Arts: Animation: Computer Animation
-
GVU Animation
Research - applying control algorithms to physically realistic models
of the systems that we would like to animate.
-
INTRODUCTION TO
JAVA ANIMATION PROJECT - Different ways in which educational
material and specifically algorithm animations could be presented on the
WWW with specific reference to the pros and cons of using JAVA as a way
to provide algorithm animations. My study seems to indicate that it is
not at all clear that using algorithm animations in study material is necessarily
more effective than using plain textual descriptions (quite.
-
Other
Algorithm Animation Links - Bubble Sort, Selection Sort, Insertion
Sort, Merge Sort and Quick Sort could be visualized. On-the-Fly Topological
Sort-A Basis for Interactive Debugging and Live Visualization of Parallel
Programs.
-
Introduction
to the Animation of Geometric Algorithms - This paper, which will appear
as a chapter in "Handbook for Computational Geometry", edited by Sack and
Urrutia, surveys the field of geometric algorithm animation, which has
flourished in the past five years. Algorithm animation uses moving pictures
to explain a computer algorithm to students learning programming, to algorithm
researchers, or to programmers involved in debugging.
-
Animation
of Bresenham's Line Drawing Algorithm in Zeus - This animation shows
Bresenham's line-drawing algorithm, used to display a line on a raster-display.
The Line view in the lower-right shows the ideal line (in green) and very
large pixels. The Incremental Real view in the bottom-left shows the part
of the line currently being processed, and with more detail.
-
CS
7390 Algorithm Animation Project - Winter 1998 Programming Project:
Algorithm Animation Due Monday February 2, 1998 The purpose of this assignment
is to learn about designing and implementing an algorithm animation. You
will be developing an algorithm animation using the Polka animation system.
-
Untitled
- Two papers for Anind Dey's talk on 2/02/96 ANIM - John L. Bentley and
Brian W. Zeus - Marc H. ANIM is a very simplistic alogorithm animation
program that can create crude, but useful animations. It is easy to use
and easy to generate output. Advantages of using such a system include:
Classical Algorithm Problems
-
Traveling
Salesman - Smith must visit each customer, but not wishing to waste
any time, doesn't want to pass through each town more than once. Jones),
the program should identify a minimal path, which minimizes the number
of times he has to pass through a town where he has already been.
-
The Traveling
Salesman Problem - The goal to solving the traveling salesman problem
is to find the shortest closed path of N cities in which each city is visited
once and the path ends in the same city that it started in. One way of
solving this problem is by means of testing every possible path through
the cities (the brute force or exhaustive method).
-
ZPR-Publications:
traveling salesman problem - A Branch and Cut Algorithm for the Asymmetric
Hamiltonian Path Problem with Precedence Constraints Ascheuer , M. J\ünger
and G. Finding maximum length tours under Euclidean norms Duality in Combinatorial
Optimization -- Sometimes it Works, Sometimes it Won't .
-
ZPR-Publications:
traveling salesman - A Branch and Cut Algorithm for the Asymmetric
Hamiltonian Path Problem with Precedence Constraints Ascheuer , M. J\ünger
and G. Finding maximum length tours under Euclidean norms Geometric Ideas
for Graph Representation and for Cooperative Game Theory
-
World-Record
Traveling Salesman Problem for 3038 Cities Solved - Recently, CRPC
researcher Bob Bixby (Rice University) and colleagues David Applegate (AT&TBellLabs),
V‰sek Chvatal (Rutgers University), and William Cook (Bellcore) using a
network of a SPARC 2, DEC Station 5000, SGI workstation, and others (a
total of 50 workstations) determined an optimal route for traveling through
3038 cities, a dramatic step beyond the old record of 2392 cities, set
by...
-
DNA Computers -
The Traveling Salesman - A salesman must travel through the northeastern
U.S., stopping at several cities along the Atlantic coast and Great Lakes
on his route.
-
Abstract
95-199 - Hamacher and C. The traveling salesman problem (TSP) is one
of the famous problems of combinatorial optimization. In this paper a generalization
of the TSP, the traveling salesman selection problem (TSSP) is introduced.
-
Genetic
Algorithms with Memory for Traveling Salesman Problems - Genetic Algorithms
with Memory for Traveling Salesman Problems
-
SSSPath
- The next node to be included must be the one with the shortest path from
vo among all nodes not in S. Let this node be v. All intermediate nodes
on the shortest path from vo to v must belong to S. S -- set of nodes "closest"
to vo for which shortest paths have already been computed. v<- next
node to be included in S. Greedy: v is that node in V-S closest to vo Dist
(u)<-- cost of.
-
Lecture
12 - Shortest Path Algorithm - Given a weighted graph, and node X,
find the shortest path from X to each node in the graph. Our algorithm
is a modified version of our traversal algorithm. The algorithm is originally
due to Dijkstra, although the presentation below is phrased in a slightly
different manner than the textbook's description of Dijkstra's algorithm.
-
Shortest
Path Calculation - The problem of finding the shortest path between
entities appears in almost every textbook written for engineering, mathematical
and compter science students. The graphs are mostly undirected and hence
we take an example of Single-Pair undirected graph in this simulation.
-
Ernesto de Queirós
Vieira Martins - This is an attempt to colaborate in the WORMS Virtual
Encyclopledia Under a general title Optimal Path Problems some (more or
less) related problems are described. Some Optimal Path Problems: Maximum
Capacity Path Problem Fractional Path Problems Minimum Cost-Time Ratio
Path Problem Minimum Cost-Capacity Ratio Path Problem Minimum Cost-Reliability
Ratio Path Problem Quickest Path Problem
-
Sci.Op-Research (1996):
Re: Q: Constrained Shortest Path Problems
-
Dijkstra
Algorithm analysis
-
Constructing
Approximate Shortest Path Maps in Three - We define two results on
approximate shortest path maps in R 3 . Given a polyhedral surface or a
convex polytope P with n edges in R 3 , a source point s on P , and a real
parameter 0 < &µ <= 1 , we present an algorithm that computes
a subdivision of P of size O((n/&µ) log( 1/&µ)) which
can be used to answer efficiently approximate shortest path queries.
Algorithm packages
Tools for analyzing algorithms
-
Analyzing
Tools for Parallel Polynomial Root-finding - Danny Luk Last update
: 13 Jun, 97 Analyzing Tools for Parallel Polynomial Root-finding in MATLAB
In considering the problem of finding all the zeros of an N -th degree
polynomial, classical algorithms calculate the zeros one at a time, with
deflation step in between, using synthetic division by ( z - a j ) to remove
the calculated zero (say a j ) from the polynomial.
-
Waterloo Maple Home Page
- Innovative Technical Solutions Learn how to animate this graphic &“I
depend on Maple V to lead me to look at those especially advanced areas
in mathematics. Maple V has made it possible for me to make use of more
mathematics in my research than I otherwise would have the time and energy
to cope with.&”
-
Maple
- A Quick Manual to Maple Version V. A Quick Tour of Maple. Frequently
Asked Questions (FAQ) About Maple (SUNY - Buffalo).
-
MAPLE V : DOWNLOAD
FRENCH MAPLE V WORKSHEETS WIND3.1 WIND95 - Download French MAPLE V
Worksheets version 4 (student edition). International Thomson Publishing.
Version Pc Mac.(500F CD) voir Fnac........ . xhumga@aol.com Vous trouverez
sur ce site des fichiers compressés (*.mws) qui ne sont lisibles
qu'avec le programme maple.
-
Penn's Maple Home Page
- Undergraduate Calculus If you are using Maple as part of a Calculus course
at Penn, there are many resources available to help you. For important
general information on Maple at Penn, click here . For a list of all of
the computer labs on campus where you can find Maple, click here .
-
MeasTex:
Adding Test Suites, Implementations and Results - MeasTex is modular:
it provides a framework for measuring the performance of a texture classification
algorithm on a test suite. New classification algorithms and new test suites
can be added without altering the framework.
Refereed journals & conferences
-
Behind
the Search Engines: Mysterious Algorithms (Related Articles)
-
Motivation to Dagstuhl-Seminar
98091 - Not only new methods and paradigms, such as randomization or
competitive analysis of algorithms, have been developed, but there is also
some shift of interest away from theory, e.g., the classical analysis of
asymptotic behavior of algorithms, to more practical issues, such as implementation
problems and the usefulness of algorithms in practical applications. Besides
the more classical.
-
Avrim Blum's home page
- I am on the program committee for COLT '98 (the Eleventh Annual Conference
on Computational Learning Theory) and was recently on the committee for
SODA '97 (the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms).
COLT '96 (the Ninth Annual Conference on Computational Learning Theory),
and on the program committee for SODA '97 (the Eighth Annual ACM-SIAM Symposium
on Discrete Algorithms).
-
GA Group Publications
List - William M. Spears. The Role of Mutation and Recombination
Evolutionary Algorithms Ph.D. thesis, George Mason University, Fairfax,
VA, 1998. Instructions for downloading . William M. Spears. A Compression
Algorithm for Probability Transition Matrices.
-
Fourth
International Conference on Principles and Practice of Constrai...
- Month: October 1998 Date: October 26--30 Name: Fourth International Conference
on Principles and Practice of Constraint Programming (CP98) Location: Pisa,
Italy. Contributions are welcome from any discipline concerned with constraints,
including: artificial intelligence, combinatorial algorithms, computational
logic, concurrent computation, databases, discrete mathematics, operations.
-
Stanford Algorithms Seminar
-
Latest
Issue: Journal of Algorithms
Professional Societies
Significant research centres
-
Neural network
research Centre: SOM_PAK and LVQ_PAK - This page is an unofficial LVQ/SOM_PAK
homepage! The official page is here . cochlea.hut.fi --> cochlea.hut.fi
contains two public-domain program packages, SOM_PAK for the Self-Organizing
Map algorithm and LVQ_PAK for the Learning Vector Quantization algorithms.
These program packages have been developed to demonstrate the implementation
of these algorithms and to ease first experiments.
-
Research
Interests - The research interests of the Centre include aspects of
number theory, approximation theory, combinatorics, differential equations,
finite fields, analysis of algorithms, real and complex functions, operator
theory, functional analysis, sequences and series and general topology.
Representation problems for real, complex and $p$--adic numbers, as well
as Laurent series over finite fields,.
-
NAG The Numerical Algorithms Group
Ltd - NAG, the Numerical Algorithms Group Ltd, produces and distributes
numerical, symbolic, statistical, visualisation and simulation software
for the solution of problems in such areas as science, engineering, financial
analysis and research.
-
The Genetic Algorithms
Group, George Mason University - Genetic Algorithms Group meetings
are held in room 430A of the Science and Technology Building II on the
Fairfax campus of George Mason University and are open to anyone who is
interested. Directions to GMU and a map of the Fairfax campus are available
online.
-
Algorithm Research Center at
uminho.pt
-
Michigan State University Genetic
Algorithms Research and Applications Group (GARAGe)
-
Colorado State Genetic
Algorithms Group
Famous Researchers
-
Peter Godman (pjg@mit.edu)
- (If you were a computer, this is what I would look like to you) No, I'm
not really that cynical, I promise. If you're still reading, I'm a math
with computer science major at MIT. My favorite language is Python .
-
Mike Levin
- Mike Levin's Evolutionary Computation Page
-
Hal Abelson
Professor, Computer Science, Massachusetts Institute of Technology
Algorithms courses
-
Algorithms Courses
on the WWW - CMSC 251, Samir Khuller, University of Maryland, and Lecture
notes on graph theoretic algorithms (1/2 meg). Lecture notes by Jianer
Chen on Computational Optimization and Computation Geometry.
-
CS819 Syllabus
- Topics will be chosen from areas such as the following: area-time upper
and lower bounds, analysis of processor interconnection networks, algorithms
suitable for implementation in VLSI, silicon compilers, and algorithms
for use in VLSI design tools. In 1996-97 this course will concentrate on
methods for developing benchmarks and analyzing algorithm performance for
various aspects of the.
-
Design
and Analysis of Algorithms (CSE 5311) Summer 1998 - Past semesters
taught: Fall 92 , Summer 93 Description: Techniques for analyzing upper
bounds for algorithms and lower bounds for problems. Problem areas include:
sorting, data structures, graphs, dynamic programming, combinatorial algorithms,
organization of numerical computations, introduction to parallel models.
-
Winter School
in Evolutionary Algorithms - CfM Winter School in Evolutionary Algorithms
Biography of Henrik Esbensen Henrik Esbensen received a B.Sc. in Mathematics
in 1989 and a Ph.D. in Computer Science in 1994, both from Aarhus University,
Denmark.
-
Quentin
F. Stout Teaching - Description of courses taught by Quentin Stout,
computer science professor at U. Michigan. Algorithms, parallel computing,
the web for computer scientists, and parallel algorithms for precollege
students.
-
Roger Whitney's Courses
- Roger Whitney's Courses To Roger Whitney's Home Page San Diego State
University -- This page last updated 19-Aug-98 If you wish to know more
about my classes the following courses contain all class notes, lectures,
assignments, syllabus and exams.
-
Computer Science
Courses at Dartmouth - Please note that this information is provided
on-line for convenient reference, but that the Dartmouth College Bulletin
Organization, Regulations, and Courses represents the official rules. Course
Numbering System: For Computer Science courses numbered above 20. the last
digit in the course number indicates the field of computer science as follows:
application systems, 3; artificial...
-
CTC Online
Courses: Heuristic Algorithms - CTC Online Courses: Heuristic Algorithms
Lecturer: Mícheál ÓhÉigeartaigh
, Allen Mushi , Paula Carroll moh@compapp.dcu.ie Course Description Course
Content Reference Material
Bibligraphies
Preprint archives
lxu3@gl.umbc.edu