Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!pipex!uknet!liv!lucs!cmsaswan
From: cmsaswan@csc.liv.ac.uk (A.J. Swann)
Subject: Placement for VLSI?
Sender: news@compsci.liverpool.ac.uk (News Eater)
Message-ID: <Cz220F.7Jn@compsci.liverpool.ac.uk>
Nntp-Posting-User: cmsaswan
Date: Thu, 10 Nov 1994 14:09:51 GMT
Lines: 35
Nntp-Posting-Host: volga.csc.liv.ac.uk
Organization: Computer Science, Liverpool University





I have read articals about algorithms for solving the
VLSI placement problem, but now I am looking for more information
on two points.

1. What _exactly_ is the fitness function being optimized?

2. What are the statistical characteristics of optimal solutions?




An answer to 1 would include such things as required connectivity between
the units as n increases, and the difference between vertical neighbour
distance and horizontal neighbour distance.

An answer to 2 would contain such details as connection length distribution, 
that is how many connections have each possible length, in the global 
optimal solution as n increases?



All references, opinions and code welcome, I will post a summary of Email.



Thanks in advance,



Andrew Swann.

