[ Usenet FAQs | Search | Web FAQs | Documents | RFC Index ]
    Search the FAQ Archives

Part1 - Part2 - Part3 - Part4 - Part5 - Part6 - Single Page

Top Document: Artificial Intelligence FAQ:6/6 AI Software [Monthly posting]
Previous Document: [6-13] Temporal Reasoning - Truth Maintenance


[6-14] Search



Search:

   AISEARCH is a C++ class library for search algorithms implemented by 
   Peter Bouthoorn <peter@icce.rug.nl>. It includes implementations of
   DFS, BFS, uniform cost, best-first, bidirectional DFS/BFS, and AND/OR
   DFS/BFS search algorithms. It is available by anonymous ftp from
   ftp://obelix.icce.rug.nl/pub/peter/ as aisearch.zip or aisearch.tar.Z.

Simulated Annealing:

   ASA (Adaptive Simulated Annealing) is a powerful global optimization
   C-code algorithm especially useful for nonlinear and/or stochastic
   systems. Most current copies can be obtained by anonymous ftp from

      ftp://ftp.alumni.caltech.edu/pub/ingber/ [131.215.48.62]

   an uncompressed version, asa, also is in that archive.  There are several
   related (p)reprints in the Caltech archive, including sa_pvt93.ps.Z,
   "Simulated annealing: Practice versus theory." The first VFSR code was
   developed by Lester Ingber in 1987, and the reprint of that paper is
   vfsr89.ps.Z, "Very fast simulated re-annealing".  If you cannot use
   ftp or ftpmail, then copies of the code are also available by email
   from the author at ingber@alumni.caltech.edu. To be added to the
   mailing list, send mail to asa-request@alumni.caltech.edu.

   The VFSR code was made publicly available in 1992 under the GNU GPL, by
   Lester Ingber and Bruce Rosen.  The last version of that code before
   the introduction of ASA is available via anonymous ftp from
   ftp://ringer.cs.utsa.edu/pub/rosen/.  Bruce Rosen has a comparison
   study, "Function Optimization based on Advanced Simulated Annealing,"
   which is available via anonymous ftp from
   archive.cis.ohio-state.edu:/pub/neuroprose/rosen.advsim.ps.Z.
   [VFSR is no longer supported, but ASA is. --mk]


________________________________________________________
Subject: [6-14] Constraint Satisfaction
   
   COMERCIAL PRODUCT COMERCIAL PRODUCT COMERCIAL PRODUCT 

   Koalog Constraint Solver. Koalog Constraint Solver is a
   constraint solver written in the JavaTMprogramming language.

   It provides technology for solving satisfaction and optimization
   problems, including:

    * scheduling;
    * time-tabling;
    * resource-allocation;
    * configuration:

   COMERCIAL PRODUCT COMERCIAL PRODUCT COMERCIAL PRODUCT 

---
[ comp.ai is moderated.  To submit, just post and be patient, or if ]
[ that fails mail your article to <comp-ai@moderators.isc.org>, and ]
[ ask your news administrator to fix the problems with your system. ]



Top Document: Artificial Intelligence FAQ:6/6 AI Software [Monthly posting]
Previous Document: [6-13] Temporal Reasoning - Truth Maintenance

Part1 - Part2 - Part3 - Part4 - Part5 - Part6 - Single Page


[ Usenet FAQs | Search | Web FAQs | Documents | RFC Index ]

Send corrections/additions to the FAQ Maintainer:
crabbe@usna.edu, adubey@coli.uni-sb.de

Last Update September 08 2008 @ 00:10 AM

© 2008 FAQS.ORG. All rights reserved.