MadKit is a modular and scalable multiagent platform written in Java and built upon the AGR (Agent/Group/Role) organizational model: agents are situated in groups and play roles.

<http://www.madkit.org/>

PAGES PERSONNELLES - HOME PAGES

Alexander Reinefeld

An Improvement of the Scout Tree Search Algorithm pdf

<http://www.zib.de/reinefeld/>

David P. Williamson

Senior Manager of the IBM Almaden CS Principles and Methodologies Group

courses on approximation algorithms

<http://www.almaden.ibm.com/cs/people/dpw/>

Michael Trick

Graduate School of Industrial Administration Carnegie Mellon University Pittsburgh, PA USA

<http://mat.gsia.cmu.edu/trick/>

ALGORITHMES

MTD(f)

MTD(f) is a new minimax search algorithm, simpler and more efficient than previous algorithms. In tests with a number of tournament game playing programs for chess, checkers and Othello it performed better, on average, than NegaScout/PVS (the AlphaBeta variant used in practically all good chess, checkers, and Othello programs).

<htt:/_theory.lcs.mit.edu/~plaat/mtdf.html>

Fast Karatsuba multiplication

21 Jan 1999, Carl Burch

This program implements a reasonably efficient multiplication algorithm (Karatsuba multiplication) and times it against the traditional grade-school technique.

(See the link Karatsuba method 'Divide and conquer' below, in this page).

<http://www.users.csbsju.edu/~cburch/proj/karat/karat.txt>

Shortest Common Superstring Problem

Sarita Challagulla Geoff Rothman Shelia Sittinger Chris WElls

What is the shortest string which contains all of these strings?

This problem was proven to be NP-Complete in 1977 by Maier & Storer by reduction from the Vertex Cover problem.

<http://www.engr.uky.edu/~grothman/np/>

Searching for Shortest Common Supersequences

Tommi Rintala

In this paper we describe a genetic algorithm (GA) for the Shortest Common Supersequence (SCS) problem

<http://www.uwasa.fi/cs/publications/2NWGA/node100.html>

Shortest Common Supersequence

Editors: Pierluigi Crescenzi and Viggo Kann

A compendium of NP optimization problems

This is a continuously updated catalog of approximability results for NP optimization problems. The compendium is also a part of the book Complexity and Approximation

<http://www.nada.kth.se/~viggo/wwwcompendium/node164.html>

On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences

Tao Jiang and Ming Li

<http://epubs.siam.org/sam-bin/dbq/article/23842>

Problem Set Archive

Here you will find hundreds of problems. They are like the ones used during programming contests, and are available in HTML and PostScript formats. You can submit (by web or mail) your C, C++, Pascal or Java sources, trying to solve any of the problems available in our database.

<http://acm.uva.es/problemset/>

DEMOS

A demonstration of top-down splaying

Daniel D. K. Sleator

<http://bobo.link.cs.cmu.edu/cgi-bin/splay/splay-cgi.pl>

EXEMPLES - EXAMPLES

C code An Introduction to NURBS

by David F. Rogers

An Introduction to NURBS is the ideal resource for anyone seeking a theoretical and practical understanding of these very important curves and surfaces.

<http://www.nar-associates.com/nurbs/c_code.html>

DICTIONNAIRES GLOSSAIRES - DICTIONARIES

Dictionary of Algorithms, Data Structures, and Problems

compiled originally for the CRC Dictionary of Computer Science, Engineering and Technology

lgorithms include common

<http://www.nist.gov/dads/>

LOGICIELS - SOFTWARES

Combinatorial algorithms

<http://www.math.mtu.edu/~kreher/cages/Src.html>

O'Rourke Code

Joseph O'Rourke Department of Computer Science, Smith College. Northampton, MA 01063, USA

Light rays reflecting from mirrors. Shortest paths on a polyhedral surface. Random or uniform points on a sphere.Volume of a polyhedron. Orientation of 2D polygon (cw/ccw). Centroid of 2D simple polygon. Polygon Visibility Graphs. Intersection of triangles in 3-space. Code assosciated with textbook

<http://www.cs.smith.edu/~orourke/code.html>

JAVA

Applets Java

Ovidiu Schipor, Felicia Giza, Florin Hrebenciuc Facultatea de Inginerie Electrica, UniversitÃ© de Suceava, Roumanie

MÃ©thode du gradient conjuguÃ©, MÃ©thode de bissection, MÃ©thode de la puissance, RÃ©gression linÃ©aire et quadratique, MÃ©thode des trapÃ¨zes, MÃ©thode d'Euler

<http://www.eudil.fr/eudil/jbeuneu/Japplets.html>

JAVASCRIPT

ProblÃ¨me inverse de l'automate fini et algorithmes gÃ©nÃ©tiques

Jean-Paul Davalan

trouver un morphisme, le plus simple possible, qui permet de reconstruire le mot Ã partir de sa premiÃ¨re lettre.

Mots de Fibonacci, de Thue-Morse ...

<http://perso.wanadoo.fr/jean-paul.davalan/mots/agfact/index.html>

THÈSES - THESIS

Quantum Monte Carlo Calculations of Electronic Excitations

By Andrew James Williamson Robinson College, Cambridge

<http://www.tcm.phy.cam.ac.uk/~ajw29/thesis/thesis.html>

DOCUMENTS - PAPERS

Brigitte VallÃ©e's Preprints and Reprints

I started my carreer in the Department of Mathematics at the University of Caen. My interests then gradually shifted from "pure" number theory to computational number theory and related problems in cryptography, most notably integer factorization and lattice reduction.

<http://www.info.unicaen.fr/~brigitte/Publications/>

Philippe Flajolet'S on-line publications

<http://algo.inria.fr/flajolet/Publications/publist.html>

Cyril Banderier's Home Page

<http://algo.inria.fr/banderier/index_fr.html>

The Karatsuba method 'Divide and Conquer'

'Here two equivalent versions of the Karatsuba method 'Divide and Conquer' ('Binary Splitting') are presented. The first version is based on the formula. (a + bx)² = a² + ((a + b)² - a² - b²)x + b²x², the second one - on the formula (a + bx)(c + dx) = ac + ((a + b)(c + d) - ac - bd)x + bdx².

Fast Algorithms and the FEE Method Ekatherina Karatsuba RU (List of research works) (CC RAS)

FAQ Answers to the frequently asked (mainly by computer scientists) questions

<http://www.ccas.ru/personal/karatsuba/divcen.htm>

hash.ps

Rasmus Pagh,

<://www.daimi.au.dk/~pagh/papers/hash.ps>

Monte Carlo Simulation for Statistical Physics

Paul Coddington Northeast Parallel Architectures Center at Syracuse University

<http://www.npac.syr.edu/users/paulc/lectures/montecarlo/p_montecarlo.html>

Practical Huffman coding

by Michael Schindler of Compression Consulting

<http://www.compressconsult.com/huffman/>

Notes on Splay Trees

D. Sleator Oct 9, 1998

<http://www.cs.cmu.edu/afs/cs/academic/class/15451-f98/www/lecture-notes/splay-trees.txt>

A compendium of NP optimization problems

<http://www.nada.kth.se/~viggo/wwwcompendium/wwwcompendium.html>

Plus rapide que QuickSort : A-Sort

<http://www.citeweb.net/delafoss/Sort/Papers/Asort.htm>

Dijkstra's Algorithm

single-source shortest paths problem.

Data Structures and Algorithms

<http://ciips.ee.uwa.edu.au/~morris/Courses/PLDS210/dijkstra.html>

Dijkstra's Algorithm

single-source shortest paths problem.

Data Structures and Algorithms John Morris University of Western Australia

<http://ciips.ee.uwa.edu.au/~morris/Courses/PLDS210/dijkstra.html>

CWI Quaterly

publishes expository and survey papers on all areas of mathematics and computer science. The papers may concern broad developments or single new interesting applications, historical reminiscences or important events. In general, the articles are related with the research being conducted at CWI, but all quality papers of general interest are welcome. Normal referee procedures will apply to all articles submitted.

<http://www.cwi.nl/publications/QUARTERLY/in_quart.html>

JOURNAUX - LETTERS

Electronic Review of Computer Books

<http://www.ercb.com/index.html>

Algorithmica

Editor-in-Chief: C. K. Wong (si souscription)

<http://link.springer.de/link/service/journals/00453/index.htm>

COURS - COURSES

Jean Berstel

Le livre ElÃ©ments d'algorithmique est paru chez Masson en 1992. Il est maintenant Ã©puisÃ©. Le livre est tÃ©lÃ©chargeable ici, en totalitÃ© ou en partie, en ps.gz ou en pdf.

ElÃ©ments d'algorithmique by Beauquier, Berstel, ChrÃ©tienne est mis Ã disposition selon les termes de la licence Creative Commons PaternitÃ©-Pas d'Utilisation Commerciale-Pas de Modification 3.0 Unported

<http://www-igm.univ-mlv.fr/~berstel/Elements/Elements.html>

<http://www.lri.fr/~magniez/dea-approx-testing.html>

Courses

Undergraduate and Introductory Graduate Courses, Advanced or Specialized Courses, Other Algorithms Related Resources

<http://www.cs.pitt.edu/~kirk/algorithmcourses/index.html>

Stanford class home pages

The class directory has been organized so that classes within the same program are grouped together.

<http://www.stanford.edu/var/dir.classes.html>

CMSC 435/634: Introduction to Computer Graphics

Introduction to graphics systems, rasterization, clipping, transformations, modeling, viewing, hidden surface removal, illumination, and shading. Emphasis on realistic, 3D image synthesis.

<http://www.cs.umbc.edu/~rheingan/435/>

A list of bioinformatics courses

<http://linkage.rockefeller.edu/wli/bioinfocourse.html>

Cours de Bioinformatique

<http://www.citi2.fr/bio2/biocours/intro.html>

Distant homologies: motifs, patterns, profiles

<http://www.icgeb.trieste.it/~netsrv/courseware/Title.htm>

Concepts des langages de l'informatique

Yoshua Bengio

<http://www.iro.umontreal.ca/~bengioy/ift2030/A00/index.html>

Algorithmes pour le calcul scientifique

Jean Beuneu Ecole Polytechnique Universitaire de Lille

<http://www.eudil.fr/eudil/jbeuneu/index.html>

TUTORIELS - TUTORIALS - TUTORS

Numerical Integration Module

Slitex Foilset CPS615 Numerical Integration Module

This module describes numerical integration covering first the simplest trapezoidal and Simpson's rule. This is followed by their general Newton-Cotes extensions and adaptive Simpson's Rule. Gaussian integration is briefly described. Most of the presentation is devoted to Monte Carlo methods including Importance Sampling and Metropolis Method. Examples are given from financial modelling, experimental and theoretical high energy physics.

<http://www.npac.syr.edu/users/gcf/CPS615NI95/p_NI.html>

MANUELS - MANUALS

GCG SENN - Education

<http://www.ch.embnet.org/CoursEMBnet/Teaching/gcg/gcg.html>

TSPLIB

is a library of sample instances for the TSP (and related problems) from various sources and of various types.

<http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/>

QUESTIONS - FAQ

Usenet FAQs By Archive-name

<http://www.faqs.org/faqs/by-archive-name.html>

algorithms-faq

<ftp://rtfm.mit.edu:/pub/usenet/news.answers/graphics/algorithms-faq>

LIENS - LINKS

NP optimization problems

<http://www.nada.kth.se/~viggo/problemlist/links.html>

Advertising : If you see a reference in one of the files that is not linked, and you know of a link address to the appropriate document, please send me mail, and I will include the link in the document. Thanks very much in advance.
Avertissement : Le classement par catégories est approximatif. Certains liens se retrouvent dans des rubriques différentes et sur plusieurs pages. Les commentaires sont généralement des courts extraits des pages référencées. Il est possible que certains liens nécessitent une mise à jour.
Tous commentaires ou remarques sont les bienvenus, vous pouvez les adresser à :
écrire

Les mises à jour demandées sont réalisées dès que possible et, sauf si c'est nécessaire, aucun message de réponse n'est expédié. Merci de m'écrire.

Copyright © 1999-2012 Jean-Paul Davalan - Reproduction interdite.