you're reading...

SACT Talk: Parameterized Analysis of Bio-Inspired Computing

Time: 1:00pm Tuesday 26, 2013

Location: SIT 123 Lecture TheatreĀ 124 Boardroom

Speaker: Frank Neumann, University of Adelaide


General purpose algorithms are often applied when no good problem specific algorithm is available. Many of such algorithms are inspired by optimization processes in nature and fall into the area of bio-inspired computing. Bio-inspired computing includes well-known approaches such as evolutionary algorithms and ant colony optimization.

The theoretical understanding of these, in practice successful, algorithms has gained increasing interest in recent years. Studying the computational complexity of bio-inspired computing has become a major part in their theoretical analysis.
We investigate bio-inspired computing methods in the context of parameterized complexity and present results for this new research area by considering two classical problems, namely the vertex cover problem and the Euclidean traveling salesperson problem.

Joint work with Stefan Kratsch and Andrew Sutton



No comments yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 68 other followers

%d bloggers like this: