! Aware > default selections > Execution > Algorithms >


sorting, searching, etc.
Subsets on this page: - #Q&A - #Articles - #Books -
Search ! Aware:

  By ANN

Search all pages


By activity
Professions, Sciences, Humanities, Business, ...

User Interface
Text-based, GUI, Audio, Video, Keyboards, Mouse, Images,...

Text Strings
Conversions, tests, processing, manipulation,...

Integer, Floating point, Matrix, Statistics, Boolean, ...

Algorithms, Memory, Process control, Debugging, ...

Stored Data
Data storage, Integrity, Encryption, Compression, ...

Networks, protocols, Interprocess, Remote, Client Server, ...

Hard World
Timing, Calendar and Clock, Audio, Video, Printer, Controls...

File System
Management, Filtering, File & Directory access, Viewers, ...

Subject Divisions (default selections)
(These links to detailed subjects under this one retain your personalized selections.)

Searching Algorithms - Algorithms for locating an item by searching.

Sorting Algorithms

Up to Algorithms - sorting, searching, etc.

#Overviews and other related subjects# - related, but not under or including this subject directly.

Books: Showing

The Algorithm Design Manual
[Steven S. Skiena, Steve Skiena; 1997-11] ISBN 0387948600
- At Barnes & Noble - At Amazon - At Half

Introduction to Computing and Algorithms
[Russell L. Shackleford, Russell L. Shackelford; 1997-10] ISBN 0201314517
- At Barnes & Noble - At Amazon - At Half

The Design and Analysis of Algorithms (Texts and Monographs in Computer Science)
[Dexter C. Kozen, David Gries (Editor); 1992-01] ISBN 0387976876
- At Barnes & Noble - At Amazon - At Half

Articles: Showing

Predicate Caching for Data-Intensive Autonomous Systems ( Nabil N. Kamel ; IEEE Computer Magazine 1997-11)

- Predicate caching, unlike traditional caching, relies not only on device speed to improve performance but also on preprocessing data. It is particularly effective on data-intensive AI and expert systems applications.

Color and Sound in Algorithm Animation ( Marc H. Brown, John Hershberger ; IEEE Computer Magazine 1992-12)

- The techniques developed by M. M. Brown and R. Sedgewick (1985) in using the Balsa algorithm-animation system are reviewed. Techniques that focus on color and sound, areas just opening up in workstation-based interactive algorithm-animation systems, are described. Color is used for encoding the state of data structures, highlighting activity, trying multiple views together, emphasizing patterns, and making an algorithm's history visible in a single static image. Sound is used for reinforcing visuals, conveying patterns, replacing visuals, and signaling exceptional conditions. The techniques are based on work done with the Zeus algorithm-animation system. Six screen dumps from six different algorithm animations that are representative of the was Zeus was used are presented.

Tango: A Framework and System for Algorithm Animation ( John T. Stasko ; IEEE Computer Magazine 1990-09)

- The role of animation in understanding and evaluating programs and developing new programs is discussed. A framework for algorithm animation, called Tango, and a system based on that framework are introduced. Related work is reviewed, and the conceptual framework on which Tango is based is examined. The implementation of the Tango system is described. The first-fit bin-packing algorithm is animated to illustrate how the path-transition paradigm simplifies algorithm animation.

How Do We Read Algorithms? A Case Study ( Martha E. Crosby, Jan Stelovsky ; IEEE Computer Magazine 1990-01)

- The authors report on an experiment that explored the way subjects view an algorithm, written in Pascal, and the graphical representation of its behavior. They designed the experiment to examine the influence of programming experience on how subjects view a short but complex algorithm, and they analyzed the scan patterns of eye movement for subjects at two experience levels. They describe the experimental procedure in detail, and discuss the results. An important finding was that all subjects needed numerous fixations in most areas of the algorithm and spent more time viewing relevant slide areas than did subjects in studies using simple text. This supports the hypothesis that viewing strategies for algorithms differ from those for prose.

A Data-Driven VLSI Array for Arbitrary Algorithms ( Israel Koren, Bilha Mendelson, Irit Peled, Gabriel M. Silberman ; IEEE Computer Magazine 1988-010)

- The design of specialized processing array architectures, capable of executing any given arbitrary algorithm, is proposed. An approach is adopted in which the algorithm is first represented in the form of a dataflow graph and then mapped onto the specialized processor array. The processors in this array execute the operations included in the corresponding nodes (or subsets of nodes) of the dataflow graph, while regular interconnections of these elements serve as edges of the graph. To speed up the execution, the proposed array allows the generation of computation fronts and their cancellation at a later time, depending on the arriving data operands; thus it is called a data-driven array. The structure of the basic cell and its programming are examined. Some design details are presented for two selected blocks, the instruction memory and the flag array. A scheme for mapping a dataflow graph (program) onto a hexagonally connected array is described and analyzed. Two distinct performance measures-mapping efficiency and array utilization-and some performance results are discussed.

Questions and Answers: Showing

Deep Algorithms? [2002/03/26]

At Ask Slashdot

A Cookbook of Algorithms? [ 1998/09/04]

At Ask Slashdot

Related Subjects (default selections)
Subject classifications directly under this one are #here#.

(The following links to subjects at this site retain your personalized selections.)

Up to Execution

(There may be additional related subject pages listed here)


Use our system: Bring Rapid Knowledge Transfer and Awareness to your company website!

Rapid-Links: Search | About | Comments | Submit Path: RocketAware > Execution > Algorithms >
RocketAware.com is a service of Mib Software
Copyright 2002, Forrest J. Cavalier III. All Rights Reserved.
We welcome submissions and comments