Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!uunet!ncrlnk!ncrcae!hubcap!landman
From: landman@hanami.Eng.Sun.COM (Howard A. Landman x61391)
Newsgroups: comp.parallel
Subject: Re: Function Minimization references?
Message-ID: <7305@hubcap.clemson.edu>
Date: 4 Dec 89 14:09:27 GMT
Sender: fpst@hubcap.clemson.edu
Lines: 14
Approved: parallel@hubcap.clemson.edu

In article <7133@hubcap.clemson.edu> hplabs!walker@hpl-opus.hp.com (Rick Walker) writes:
>  ...
>  By exploring the N-dimensional space formed by the various potential
>  combinations of the N circuit element values, it is possible to converge
>  to an (at least locally) optimal design. ....

You should look into Bill Nye's (sp?) work at Berkeley a few years ago.
I believe the program was called "Delight" or something like that.  His
top level optimization algorithm was quite general and was applied to
several different problem domains (SPICE-based circuit optimization was
one of them).  I don't know how parallelizable it is.

	Howard A. Landman
	landman%hanami@eng.sun.com


Brought to you by Super Global Mega Corp .com