141. Informatik - Universität Des Saarlandes - Saarbrücken Department of computer Science. Areas of research include combinatorics, computational geometry, compilers for realtime embedded systems, formal modelling of circuits, computer architecture, description and planning logics, formal grammars, cryptography, and distributed algorithms. http://www.cs.uni-sb.de/

AktuellesNeues aus der InformatikVorträgeJobbörse ... mehr ... Informatik Universität des Saarlandes Willkommen English Deutsch Sitemap

142. Computer Animation: Algorithms And Techniques - Title Page And Preface computer Animation algorithms and Techniques. Rick Parent, computer Animation algorithms and Techniques, MorganKaufmann, 2001. http://www.cse.ohio-state.edu/~parent/book/preface.html

Computer Animation: Algorithms and Techniques Preface This is a rough draft of my class notes on computer animation. It does contain typos and some mistakes, so 'buyer beware'. I've had this up on the web for some time and had hoped that when people saw it, they would contribute links or other information that would make this truly a web-book. This never really happened, so it looks like I'm going to bite the bullet and actually make this into a 'real' book. As a result I haven't been concerned with correcting these notes or updating them. The book incorporates most of the information here as well as a bunch more. The book offers additional electronic information in the form of web pages. The book is published by Morgan-Kaufmann. Rick Parent, Computer Animation: Algorithms and Techniques Morgan-Kaufmann, Interested readers might also take a look at my resource page which has a lot of links to information related to computer animation (also linked to by www.computeranimation.org). Go to Table of Contents Rick Parent (parent@cis.ohio-state.edu)

143. Computer Methods For Mathematical Computations Code from the book, translated to ELF, a Fortran 90 subset. algorithms for calculations in science and engineering, including linear equations, spline interpolation, integration, differential equations, zero finding, minimization and singular value decomposition. http://www.pdas.com/fmm.htm

PDAS home Public Domain Aeronautical Software (PDAS) Computer Methods for Mathematical Computations Computer Methods for Mathematical Computations by George Forsythe, Michael Malcolm and Cleve Moler is one of the great classic textbooks of numerical methods for scientists and engineers. Many people (myself included) have used the book as a reference and used the programs as tools for a variety of computing projects. Although the algorithms are still usable in their original pre-Fortran 77 format, the readability and usability is greatly enhanced by using the coding style of modern Fortran. I have rewritten the procedures in modern Fortran. In particular, the library will now compile correctly using Lahey Essential Fortran (ELF), which is a subset of the general Fortran language. Successful compilation with ELF is a virtual guarantee that you are not using any proprietary Fortran extensions that might affect the portability of your code. List of Procedures and arguments Source code for the library of algorithms Source code for the sample problems Expected results from running the samples Comments on the modern coding These codes are on the current (version 8) disc. I intend to replace the routines that were originally included with some of the aeronautical programs with the counterparts from this library.

144. INI Programme CMP Research programme at the Isaac Newton Institute, Cambridge UK. Themes include Randomised algorithms; Phase transitions in statistical physics and computer science; Random graphs and structures. August December 2002. http://www.newton.cam.ac.uk/programs/CMP/cmp.html

@import url(/css/prog-non_n4.css); Institute Home Page Programmes Web-Seminars Programme Home Seminars Workshops Participants Long Stay Short Stay Additional Links Contacts Mailing List Background Isaac Newton Institute for Mathematical Sciences Computation, Combinatorics and Probability 29 Jul - 20 Dec 2002 Organisers : Professor Martin Dyer ( Leeds ), Professor Mark Jerrum ( Edinburgh ), Dr Peter Winkler ( Bell Labs Programme theme As Computer Science has matured as a discipline, its relationships with mathematics have become both more wide ranging and more profound. The programme will explore two particularly fruitful interfaces between computer science and mathematics, namely those with combinatorics and probability theory. Although no interdisciplinary work within the broad area delineated by the title will be excluded, the following themes will receive special emphasis. Randomised algorithms. The design and analysis of algorithms that make random choices; also deterministic algorithms when run on random instances.The theoretical basis here includes the study of parameters connected with random walks on graphs and the relationships between them. "Phase transitions" in statistical physics and computer science.

145. Rostock, University computer Science Department. Research areas include theoretical computer science, algorithms and theory of programming, computer architecture, information and communication services, parallel and super computing. databases and information systems, programming languages and compilers, simulation, software techniques, and computer graphics. http://www.informatik.uni-rostock.de/en/

Faculty Divisions Research Education ... Search © University of Rostock, Department of Computer Science, A.-Einstein-Str. 21, 18059 Rostock phone:++49(381)498-3400, E-Mail: fachbereich@informatik.uni-rostock.de , Chairman of the Department: Prof.Heuer Last modified: 9.Juni 2003, 521 Accesses (since 2.12.2003), wwwfbin@informatik.uni-rostock.de

146. Welcome To LaBRI Bordeaux. Researchers at the LaBRI are organized into five research teams Combinatorics and Algorithmics (Enumerative combinatorics, maps, physics; Random generation and visualization; Graphs and applications; Distributed algorithms); Logic, Formal Languages, and Applications (Graphs and logic; Formal languages; Rewriting, Databases); Modeling, Verifying and Testing Computerized Systems; Parallel and Distributed Computing;Image and Sound (Image analysis; Image synthesis) http://www.labri.u-bordeaux.fr/index-en.htm

Laboratoire Bordelais de Recherche en Informatique Unité Mixte de Recherche CNRS (UMR 5800) News Common News Seminars Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex FRANCE mail : direction@labri.fr phone : +33 5 40.00.69.00 fax : +33 5 40.00.66.69 Director : Serge Dulucq Adjoint : Pascal Guitton Coming to LaBRI Le Labri Presentation Report (pdf) Telephone Directory Staff ... Publications Research Research groups Combinatorics and Algorithmics Logic, Automata, Algorithms and Applications Modeling, Checking and testing ... Image and Sound Projects Compose Scalapplix Scrime Signes ... Visidia Training Third cycle Ph.D Studies D.E.S.S. Second Cycle Departement of Informatics Licence Maîtrise IUP Miage First cycle DEUG IUT Valorisation et transfert Industrial Relationships Labri-transfert Intranet

147. Institute Of Computer Science Institute of computer Science. Research covers applied computer science, neural networks, parallel genetic algorithms, and fluid dynamics on parallel systems. http://www.informatik.uni-osnabrueck.de/index.php

Department of Mathematics/Computer Science Institute of Computer Science The Institute Research Groups General Information Travel Guide OS/Westerberg Secretariate System Administration ... Neuroinformatics Studies Information for Students Current Courses All Courses Erweiterungsfach Informatik B.Sc. in Mathematics/Computer Science ... Algorithms Photos Other Information Search UNI-AG for High School Students Local Manuals Virtual Institute Alumni Information ... Webserver-Team Last changed: 2004-04-19

148. Digraphs, Theory, Algorithms, Applications A comprehensive source of results, notions and open problems on directed graphs, with 12 chapters, 754 pages, 186 figures and 705 exercises. The book is aimed at undergraduate and graduate students, mathematicians, computer scientists and operational researchers. Site has preface, contents, chapter 1 and other extracts (PS) with errata, updates and ordering information. http://www.imada.sdu.dk/Research/Digraphs/

IMADA Research activities Digraphs: Theory, Algorithms and Applications Springer-Verlag, London Springer Monographs in Mathematics ISBN 1-85233-268-9 October 2000 754 pages; 186 figures; 705 exercises Second printing has been released from Springer in April 2001. Softcover version is available as of May 2002 at 29.50 British Pounds. The ISBN number is 1852336110. Welcome to the web page for the book Digraphs: Theory, Algorithms and Applications, by and Gregory Gutin. This page contains some useful information about the book. The page will be updated frequently. Should you have questions, please contact one of the authors by email jbj@imada.sdu.dk gutin@cs.rhul.ac.uk You may also consult Springer's catalogue page for the book at Springer's book catalogue Selected parts of the book (postscript). Preface List of Contents Subject index Chapter 1 ... Pages 658-659 Mathematics Subjects Classifications: 05C20, 05C38, 05C40, 05C45, 05C70, 05C85, 05C90, 05C99, 68R10, 68Q25, 68W05, 68W40 90B06, 90B70, 90C35, 94C15 How to order Springer's book catalogue Amazon.co.uk

149. University Of Trier (Trèves) / CS Homepage computer Science Department. Research groups cover stochastic modelling and computer networks, theoretical computer science, programming languages and compilers, databases and information systems, system software and distributed systems algorithms and data structures. http://www.informatik.uni-trier.de/

CS Department, University of Trier deutschsprachige Fassung dieser Seite Student Homepages Troubleshooting Problems accessing our web server? Solutions here! Department News Information for new students (german) Divisions Stochastic Modelling and Computer Networks Prof. Dr. Dieter Baum Theoretical Computer Science and new Applications ... Bernd Walter Information about CS Department CS Studies in Trier Student's Calendar Student Representatives Current Courses and online Scripts ... Colloquium and ongoing Seminar on CS Localization Related fields: Computer Linguistics Mathematics Business Computer Science Specific Activities 6th International Symposium RM03 Internet-Bridge Trier-Beijing Electronic Colloquium on Computational Complexity (ECCC) (WEP) Complexity SIG of the German Society for Computer Science (GI) Software MSDN Academic Alliance (german) NEWS Tele-Teaching Prof. Dr. sc. Christoph Meinel Internet Security I - Internet Technology on-demand for the internet bridge Trier - Beijing Prof. Dr. sc. Christoph Meinel Internet Security I - Internet Technology on-demand for students from Trier and ULI Prof. Dr. sc.

150. Complexity Of Algorithms, Contents A list of topics from a computer Science course involving complexity of algorithms. HTML and PS format. http://artemis.cs.yale.edu/classes/cs460/Spring98/contents.html

Complexity of Algorithms (Topic outline) Models of computation Finite automata Turing machines Random Access Machines ... The power of machines: algorithmic decidability 2.1 Regular languages Recursive and recursively enumerable languages Other algorithmically undecidable problems Logically undecidable problems Exercises ... Time and space: general complexity theory Exercises Non-deterministic algorithms Non-deterministic Turing machines The complexity of non-deterministic algorithms Languages in NP ... Pseudo-random numbers 8.1 Classical methods Pseudo-random numbers One-way functions Exercises 9. Parallel algorithms 8.1 Parallel random access machines 8.2 The class NC Exercises 10. Decision trees 9.1 Algorithms decision trees: sorting and searching 9.2 Non-deterministic decision trees 9.3 Lower bounds on the depth of decision trees Exercises 11. Communication complexity 10.1 Communicaton matrix and protocol-tree 10.2 Non-deterministic communication complexity 10.3 Randomized protocols Exercises 12. The complexity of algebraic computations

151. Evolutionary Algorithms In Computer-Aided Molecular Design Evolutionary algorithms in computerAided Molecular Design. Desjarlais, JR and Clarke, ND computer Search algorithms in Protein Modification and Design. http://panizzi.shef.ac.uk/cisrg/links/ea_bib.html

Evolutionary Algorithms in Computer-Aided Molecular Design Contents General EA References - Books General EA References - Articles General Chemistry-Related References Reviews of CAMD Applications ... Last Update GENERAL EA REFERENCES - BOOKS Clark, D.E. (Ed). Evolutionary Algorithms in Molecular Design . Wiley-VCH, Weinheim, 2000. Michalewicz, Z. and Fogel, D.B. How to Solve it: Modern Heuristics. Springer-Verlag, 2000. Bentley, P.J. (Ed.) Evolutionary Design by Computers. Morgan Kaufmann, 1999. Koza, J.R., Bennett, F.H., Andre, D. and Keane, M.A. Genetic Programming III: Darwinian Invention and Problem Solving. Morgan Kaufman, 1999. Coley, D.A. Introduction to Genetic Algorithms for Scientists and Engineers. World Scientific, 1999. Fogel, D.B. (Ed.) Evolutionary Computation: The Fossil Record. IEEE Press, Piscataway (NJ), 1998 (ISBN: 0-7803-3481-7). Falkenauer, E. Genetic Algorithms and Grouping Problems , Wiley, Chichester, 1997. Banzhaf, W., Nordin, P., Keller, R.E. and Francone, F.D. Genetic Programming: An Introduction on the Automatic Evolution of Computer Programs and its Applications , Morgan Kaufmann, San Francisco, 1997.

152. TUM Informatik - Faculty of Informatics. Research groups focus on programming, distributed systems, formal languages, compiler construction, database systems, engineering applications of computer science, numerical methods, real time systems, robotics, theoretical computer science, artificial intelligence, communication, deduction, knowledge based systems, image processing, computer architecture, applied computer science, operating systems, networks, and algorithms. http://www.informatik.tu-muenchen.de/index_en.html

Department of Informatics HOME ACADEMIC RESEARCH FACULTY ... Feedback Welcome to the Department of Informatics! ACADEMIC The lectures of Summer Semester 2004 start Monday, 19/04/2004 and finish Friday, 23/07/2004. This site provides information for all courses, academic affairs, application, and much more. Starting with the Winter Semester 2002/2003 the department offers special programs for gifted students . Beginners and students starting their third semester in Informatics may apply for this programs until October/01/2003. FACULTY Campus Garching Address How To Get Here Campus Map ... Cafeteria in the FMI-Building DREHSCHEIBE New WAP-Access to parts of the contents and functionalities of this Web-Site is in the state of Beta-test. More Information: /doku/wap Current Events TU-Film: Nicht Auflegen! Festveranstaltung: Friedrich L. Bauer 80 Jahre Vortrag: Ein mögliches Szenario für den PC um 2010 und seine Bedeutung für unser Leben TU-Film: Findet Nemo (Open Air in Garching) New Announcements Vortrag: Ein mögliches Szenario für den PC um 2010 und seine Bedeutung für unser Leben Sonderkolloquium: Actor-Oriented Design: Concurrent Models as Programs Festveranstaltung: Friedrich L. Bauer 80 Jahre Deutsch-italienische Hochschultage ... ... More ... Search in Announcements Courses Persons Rooms Web-Pages Student in München? Check out

153. Illinois Genetic Algorithms Laboratory IlliGAL studies nature's search algorithm of choice, genetics and evolution, as a practical approach to solving difficult problems on a computer. Research at IlliGAL has concentrated on the development of a design theory for selectorecombinative GAs, their competent design and implementation, GAs using selection and recombination that solve hard problems, quickly, reliably, and accurately, and the analysis and design of efficiency enhancement measures through parallelization, time utilization, hybridization, and evaluation relaxation. http://www-illigal.ge.uiuc.edu/

154. Jeffrey D. Ullman J.D. Ullman He is a famous author of computer science books, on algorithms Discrete Mathematics . http://www-db.stanford.edu/~ullman/

Jeffrey D. Ullman Jeff Ullman is the Stanford W. Ascherman Professor of Computer Science (Emeritus). His interests include database theory, database integration, data mining, and education using the information infrastructure. What's New Polemics Publications Books ... Biographical Information What's New Gradiance I'm a founder of Gradiance Corporation , whose goal is to provide better, cheaper homework and programming-lab support for college courses. Our first offering is support for database courses, but we hope to be covering all of computer science, and more soon. New Set of CS345 Materials I taught CS345 in Spring 2003 as a mixture of database theory and data-mining algorithms. The Main CS345 Page has been updated to include new materials and Powerpoint slides. CS145 Slides Now Available In the Fall of 2002 I developed a set of Powerpoint slides with voiceover. I have made them available to anyone who would like to use them. However, these are large files, about 20MB on average. The slides are also available in GIF or Powerpoint, without the voiceover, for those who prefer slides that don't talk at them and that download a lot faster. Here is the Directory of Available Slide Sets Database Research Talk These Slides are from a survey talk given at the 2003 DASFAA Conference in Kyoto.

155. University Of Konstanz, Department Of Computer And Information Science Department of computer Information Science. Research topics include VLSI, algorithms for planar networks, discrete algorithms, software engineering, network design, railroad applications, graph visualization, and optimization in object databases. http://www.inf.uni-konstanz.de/index.html.en

Organisation Working Groups Secretariat Staff List Systemadministration (in German only) Department's committees (ger) Student Association Mathematics (ger) Student Association Inf. Eng. (ger) Department in the Media Courses of Summer 04 Exams of Summer 04 Lectures of Former Semesters Mathematics and Computer Science Information Engineering Information Science Offers for Other Courses of Studies Student Counselling Exams Information Information for Pupils Research Training Group (PhD Program) Events VisSym 2004 Colloquium Current lecture series (in german) Lecture series SS 03 WG 2000 EDBT 2000 KIK '99 FRICO '99 Publications Blaue Reihe Papers for information science General writings Theses (Diploma) information science News Information on the department's membership in Microsoft's Developer Network Academic Alliance (MSDNAA) program. Events: Symposium on Visualization Summer Term '04 Colloquium of the department Computer and Information science The colloquium takes place bi-weekly at wednesday 16:00 pm. All persons interested are cordially invited. Teaching: Courses of Summer '04 Have a look at the category "teaching & study" for the current list of lectures and the dates of exams.

156. CERL Sound Group The CERL Sound Group is an informal research group that undertakes hardware/software development in digital audio signal processing and computer music. Current research areas include realtime algorithms, sinusoidal modeling, user interface hardware/software for music performance, airflow, and music notation. http://www.cerlsoundgroup.org/

157. Discrete Applied Mathematics (Elsevier) Combinatorial algorithms, Optimization and computer Science. http://www.elsevier.nl:80/inca/publications/store/5/0/5/6/0/9/

158. Department Of Computer Science, The University Of Tennessee At Knoxville Offers B.S., M.S., and Ph.D. degrees in computer science. Research interests include algorithms and computability, scientific computing, genetic algorithms, image analysis, and neural networks. Online resources include UTK news reports and study abroad opportunities for computer science majors. http://www.cs.utk.edu/

University Links About the University Academic Programs Administration Libraries Research Support UT The University System A-Z Index WebMail Dept. Directory Select type of search People Search Campus Search System Search Admissions Undergraduate Admissions Graduate Admissions Transfer Students ... Contact Us Dr. Bob Ward thanks Ken and Jeane Vann at the annual 2004 ACM Banquet. [ more info... Sumarni Kemala BS Graduate Student UTK, School of Information Sciences Message: Currently, I am pursuing my Masters degree in Information Sciences. It should be another year before I complete my degree. As to my current position, I am working for the Engineering Computing Cen... [ more... 203 Claxton Complex Knoxville, Tennessee Phone: (865) 974-5067 Fax: (865) 974-4404 Email: info@cs.utk.edu Welcome Message On behalf of the faculty, I welcome you to the Department of Computer Science at the University of Tennessee at Knoxville - the flagship research university of the State of Tennessee. The department's mission is to produce scholars capable of creative work in computer science. [ more...

159. Improving Computer Control Of Batch Dyeing Operations Presentation of novel control algorithms, and specific simulation and experimental results for fuzzy logic and adaptive control systems in textile dye houses. Authors Brent Smith and Jun Lu. PDF document. http://www.p2pays.org/ref/03/02348.pdf

160. Algorithms And Data Structures In F And Fortran By Robin Vowels (Unicomp). Emphasizes fundamentals of structured programming through study of F and Fortran 90/95. It is designed for a reader's second exposure to computer programming, whether it be through selfstudy or a course in computer science. Site describes book, lists contents, and provides code examples. http://www.swcp.com/~walt/fortran_store/Html/Info/books/adsff.html

Algorithms and Data Structures in F and Fortran By Robin A. Vowels Published by Unicomp, 1998. 488 pages. $49.00 ISBN 0-9640135-4-1 Algorithms and Data Structures in F and Fortran emphasizes fundamentals of structured programming through study of F and Fortran 90/95. It is designed for a reader's second exposure to computer programming, whether it be through self-study or a course in computer science. The book is not just algorithms. Additional F/Fortran topics are included: separate theme chapter are devoted to complex arithmetic, file processing, list processing (the extensive chapter includes binary search trees), text processing including string searching, and recursion. Chapters can be studied in any order, as they are mostly independent; They can be selected at will according the reader's interests. The book is backed up by comprehensive appendices on the built-in procedures and summaries of the F and Fortran statements. It is recommended, although not essential, that the reader be familiar with the F or Fortrran 90/95 programming language, prior to using this text. One excellent introduction to F is Programmer's Guide to F The programs in the book are available here in zip format The programs in the book are available here in tar format A detailed table of contents is here The chapters are: Sorting Recursion Linked Lists and Trees Complex Arithmetic Using Published Algorithms Text Processing Files Solving Simultaneous Equations Graphics Searching Numerical Methods Whole Array Operations

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 8     141-160 of 183    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | 10  | Next 20