81. Non-negativity Condition For Cellular Automata And Other Massively Parallel Comp 26 L209) in derivations and computer algorithms is noted. When the nonnegativity condition is ignored, as was done by Gómez-Vilar and Solé, non-physical http://www.iop.org/EJ/abstract/0305-4470/29/24/039

@import url(http://ej.iop.org/style/nu/EJ.css); Quick guide Site map Athens login IOP login: Password: Create account Alerts Contact us Journals Home ... This issue M D Kostin 1996 J. Phys. A: Math. Gen. COMMENT Non-negativity condition for cellular automata and other massively parallel computer algorithms M D Kostin School of Engineering and Applied Science, Princeton University, Princeton, New Jersey 08544, USA Received 25 June 1996 Print publication: Issue 24 (21 December 1996) Abstract. The importance of satisfying the non-negativity condition given in the original paper (1993 J. Phys. A: Math. Gen. L209) in derivations and computer algorithms is noted. When the non-negativity condition is ignored, as was done by Gómez-Vilar and Solé, non-physical results may be obtained. In contrast, when the step sizes go to zero in a manner consistent with the non-negativity condition, it can be shown that the difference equations are pointwise consistent with the continuum equations of quantum theory. doi:10.1088/0305-4470/29/24/039

82. Pyramid Computer Algorithms To Find The Closest Pair Of Points upon an algorithm of Dyer that requires T(N) time on a more powerful computer. In particular, the second solution is optimal for any pyramid computer, http://www.eecs.umich.edu/~qstout/abs/JAlg85.html

In J. of Algorithms (1985), pp. 200-212. Pyramid Computer Solutions of the Closest Pair Problem Quentin F. Stout University of Michigan Abstract: Given an N x N array of 0s and 1s, the closest pair problem is to determine the minimum distance between any pair of 1s. Let D be this minimum distance (or D=2N if there are fewer than two 1s), where the distance is measured by the L (taxicab) or L metric. Two solutions to this problem are given, one requiring time and the other . These solutions are for two types of parallel computers arranged in a pyramid fashion with the base of the pyramid containing the matrix. These models, pyramid cellular automata, are quite weak in that each processor is a finite automaton which is incapable of holding the answer. These results improve upon an algorithm of Dyer that requires time on a more powerful computer. In particular, the second solution is optimal for any pyramid computer, no matter how powerful the processors. Keywords: parallel computing, pyramid cellular automata, pyramid computers, closest pair, computational geometry, nearest neighbors, parallel algorithms, finite automaton My related work in parallel computing A somewhat whimsical explanation of parallel computing.

83. Algebraic Computer Algorithms And Path Integral Methods Algebraic computer algorithms and Path Integral Methods. http://www.math.unm.edu/ACA/1998/sessions/highen/vargas/

Algebraic Computer Algorithms and Path Integral Methods EDWIN Julio VARGAS Sanchez Institut fuer theoretische Physik Universitaet Karlsruhe, Kaiserstr. 12 D - 76128 Karlsruhe, GERMANY ev@itpaxp1.physik.uni-karlsruhe.de Abstract A computer algebraic algorithm for the evaluation of functional derivatives in the path integral approach is applied to calculate the terms in a finite perturbative expansion of the generating functional and its Green functions for simple models in particle physics. About this document ... IMACS ACA'98 Electronic Proceedings

84. City University Of Hong Kong /All Locations EJ Miner ResultsTitles with the Subject Heading computer algorithms Research . 1 EJournals. Data Structures and Algorithms Preprints http://lib.cityu.edu.hk/search/d?SEARCH=Computer algorithms

85. EJ Miner Results Titles with the Subject Heading computer algorithms . 3 EJournals. Electronic Transactions on Numerical Data Structures and Algorithms Preprints http://ejournal.coalliance.org/SubjTitles.cfm?subj=Computer Algorithms

86. Www.awlonline.com/product/0,2627,0201612445,00.html www.ce.chalmers.se/external/lardat/ Design And Analysis Of computer algorithms CourseThe summary for this Bulgarian page contains characters that cannot be correctly displayed in this language/character set. http://www.awlonline.com/product/0,2627,0201612445,00.html

87. Department Of Computer Science College Of Arts And Sciences The The Design and Analysis of computer algorithms, by Aho, Hopcroft and Ullman. Algorithms, by Sedgewick; Algorithmics Theory Practice, http://www.cs.unc.edu/~geom/TEACH/COMP122/

88. 00876 Spring 2005 Computer Algorithms Home Page Translate this page Spring 2005 computer algorithms. Class Notes. Lecture Notes. Class Homework. Homework List. . Homework 2 solution ?. http://cs.sookmyung.ac.kr/~sanglee/class1/00876/

89. Encapsulating And Executing Computer Algorithms Patent Freshpatents.com offers information on a variety of new patent applications, updated each week check out Encapsulating and executing computer algorithms http://www.freshpatents.com/Encapsulating-and-executing-computer-algorithms-dt20

Monitor Patents - Encapsulating and executing computer algorithms Title/Abstract Agents Agents by City Apps by Location FreshPatents Search A FREE service from FreshPatents... PATENT KEYWORD MONITOR 3 steps to Unlock the Secrets of new technologies before competitors, co-workers or other inventors! Sign up (takes 30 seconds). Fill in the keywords to be monitored. 3. Each week you receive an email with patent applications related to your keywords. Start now! Browse Patent Applications: Prev Next USPTO Class 717 Encapsulating and executing computer algorithms A computer algorithm is encapsulated in at least two modules: at least one communication operation of the computer algorithm is encapsulated in a communication module, separately from the rest of the operations of the algorithm which may be encapsulated in an algorithm module. The separately encapsulated communication operation is made available to the algorithm module during its execution. Modules for data objects encapsulating data communicated may also be provided. A framework may be provided to ensure compatibility between different modules, wherein a plurality of protocols are provided and each module implements a corresponding protocol. All environment-dependent communication operations may be separately encapsulated so that one of the communication module and the algorithm module may be modified without modifying the other. Agent: David R. Irvin IBM Corporation T81/503

90. Zeus And Algorithm Animation At SRC Type of program visualization mainly concerned with displaying the workings of computer algorithms. This page gives access to the work being done in this area at Compaq Computer Corporation's Systems Research Center. http://www.research.compaq.com/SRC/zeus/home.html

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 Compaq Computer Corporation's Systems Research Center in this area. The algorithm animation system that we have developed is called Zeus . We've prepared a bibliography of Zeus-related papers . Many of these papers, and accompanying videotapes, are available as SRC Research Reports . One way to get a feel for Zeus is to look at an example animation ; if you want more details, look at the Zeus Tutorial . Zeus is written in Modula-3 , and is available via anonymous ftp together with the rest of the Modula-3 distribution . We also provide precompiled binaries for a few platforms Here are snapshots of a few of the animations we have built. The pictures are links to pages which provide more information on the particular animation. And there are lots more examples that you can look at. If you've never seen an algorithm animation before, here are a smaller and a larger MPEG movie showing the animation of heapsort in progress.

91. Sourcebank A collection of source code for various topics. http://www.devx.com/sourcebank/directorybrowse.asp?adType=&dir_id=653&sh

92. HU Berlin: Institut Für Informatik Department of computer Science. Research groups focus on system analysis, software engineering, theory of programming, databases and information systems, artificial intelligence, data analysis, computer science in education and society, parallel and distributed computing, automata, systems theory, algorithms, complexity, computer architecture, communication, signal processing, and pattern recognition. http://www.informatik.hu-berlin.de/

Keine Frames? -> Kein Problem. Legen Sie Ihre Startseite auf www.informatik.hu-berlin.de/home.shtml

93. Faculty Of Applied Science Faculty of Applied Science. Research interests include algorithms and data structures, computer architecture, software engineering, programming languages, artificial intelligence, computer graphics, pattern recognition and image processing, databases and information systems, maching learning, natural language processing, and autonomous systems. http://www.informatik.uni-freiburg.de/applied.htm

webcamera on the campus... faculty general information, addresses, people how to find us administration secretary's office ... students offices , interna .. studies lectures WS98/99 information on studies student organization (Fachschaft) research institute for computer science institute for microsystemtechnologies technology transfer report of research activities ... what's new? events, conferences, colloquia, publications of the academic office for foreign relations open positions project managment in the rector's office atlas technique brochure petit atlas ... HIS-project last change: 19.11.98 12:10 owner: krieger german version... Click here if this page has been incorrectly displayed This page was translated by InterTran (tm) Translate another URL: English to Portuguese English to Brazilian Portuguese English to German English to Dutch English to Latin American Spanish English to Spanish English to European Spanish English to French English Thesaurus English to Danish English to Finnish English to Icelandic English to Italian English to Norwegian English to Swedish English to Russian English to Croatian English to Hungarian English to Polish English to Czech English to Serbian (Latin) English to Slovenian English to Greek US English to UK English UK English to US English German to English German to Polish German to Norwegian German to Hungarian Danish to English Finnish to English Icelandic to English Italian to English Norwegian to English Russian to English Russian to Hungarian Swedish to English Portuguese to English Brazilian Portuguese to English

94. Operational Research Programming Trivia computer code for research algorithms in operational research and combinatorial optimization. http://www.ortrivia.com/

This page uses frames, but your browser doesn't support them. It is likely that your browser doesn't support XML either, so you cannot see most of this site. Use the links below and hope for the best. Title Page Page Sections Code Sections

95. Computer Graphics At Stanford University Stanford University. Research areas include volume rendering, rendering algorithms and systems, 3D scanning, imagebased rendering, virtual reality, compression of graphics objects, user interfaces for visualization, high-performance graphics architectures, and visualization of complex systems and environments. http://www-graphics.stanford.edu/

News flashes: - Most speakers from our recent Symposium on Computational Photography and Video have put their slides online. - All 1,186 fragments of the Forma Urbis Romae are now online , viewable by the public, and freely licensable to scholars. - Two papers about the Forma Urbis Romae . One summarizes the project; the other describes fragment matches we have found. Available information: People Research projects Courses in graphics Technical publications ... Directions for getting to our laboratory Press here for a text-only overview of our laboratory, here for some slides summarizing our current research projects and course offerings Each faculty member's home page also summarizes their research projects. Click here to learn how the banner image at the top of this page was created. If the images on this server look dark to you, see our note about gamma correction Press here for information, which also restricts use of the three-dimensional Stanford "S" in our lab logo. Other Stanford Pages: Computer Systems Laboratory Computer Science Department Electrical Engineering Department School of Engineering ... Stanford University Restrict your search by specifying site:graphics.stanford.edu

96. Randeep Singh Bhatia Department of computer Science AV Williams Building Specifically interested in designing approximation algorithms for resource allocation problems http://www.cs.umd.edu/~randeep/

97. Page Personnelle Pmaillot Site contains a set of 2D and 3D mathematical studies and algorithms for use in computer graphics, for geometry pipelines and rendering. http://www.chez.com/pmaillot/

Page Personnelle pmaillot Bienvenue! Welcome! Page maintenue par / Page maintained by Patrick-Gilles Maillot. Juin 2005 / June 2005

98. Http//www.cis.ohio-state.edu Has Changed DNS Domains The Department of computer Science and Engineering at The Ohio State http//www.cse.ohiostate.edu/hypertext/faq/usenet/graphics/algorithms-faq/faq. http://www.cis.ohio-state.edu/hypertext/faq/usenet/graphics/algorithms-faq/faq.h

99. Ontario Research Centre For Computer Algebra - ORCCA Researchers at ORCCA study algorithms and software systems for symbolic mathematical computation. At any given time a number of visitors and postdocs are hosted. http://www.orcca.on.ca/

100. Date Algorithms Provides descriptions, proofs and computer programming implementation examples to convert dates to various calendar dates for Julian, Gregorian, and Rata Die calendars. http://vsg.cape.com/~pbaum/date/date0.htm

Date Algorithms By Peter Baum Onset, MA 02558-1255 Version: 1.003 Last Modified: August 5, 1998 Various calendar dates (Julian, Gregorian, and Rata Die) are used and produced by the algorithms that are presented but no attempt has been made to account for various problems associated with the general use of historical dates. For example, 90 days were inserted into the calendar by Julius Caesar in -45 and following Caesar's death, the leap year rule was misapplied until corrected by Emperor Augustus who omitted leap years from years -8 through +4. Various locations used different calendars throughout the Middle Ages and even within one locality, different calendars were often used for dating ecclesiastical records, fiscal transactions, and personal correspondence. None of these complications are accounted for by these algorithms. The following is assumed: The year before the year 1 is and the year before is -1, et cetera. The year corresponds to 1 B.C. Julian dates may be applied both before the calendar was invented and after it was replaced as long as it is clear that the Julian leap year rules are being applied, usually by calling the date a Julian date. Gregorian dates may be applied before the Gregorian calendar was invented as long as it is clear that the Gregorian calendar leap year rules are being applied, usually by calling it a Gregorian date.

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 5     81-100 of 192    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | 10  | Next 20