JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for ORNET Archives


ORNET Archives

ORNET Archives


ORNET@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

ORNET Home

ORNET Home

ORNET  May 2010

ORNET May 2010

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

PhD Studentship: Hyper-heuristics in Co-operative Search [SCI/847]

From:

Ender Ozcan <[log in to unmask]>

Reply-To:

Ender Ozcan <[log in to unmask]>

Date:

Thu, 20 May 2010 16:40:38 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (61 lines)

[Please circulate to all those who might be interested, and accept my
apologies if you received multiple copies of this PhD studentship
announcement]
- - - - - - - - -
PhD Studentship

Hyper-heuristics in Co-operative Search

University of Nottingham - School of Computer Science

This studentship is associated with the Science and Innovation award for
"The LANCS Initiative" (see: http://www.lancs-initiative.ac.uk/). The
successful student will join the Automated Scheduling, OptimisAtion and
Planning (ASAP) research group (see: http://www.asap.cs.nott.ac.uk/) and
will investigate 'systems to build systems' in the context of co-operative
search and will have the opportunity to interact with the leading
scientists in the field.

The interest in parallel co-operative approaches has risen considerably
due to, not only the availability of co-operative environments at low
cost, but also their success to provide novel ways to combine different
(meta-)heuristics. Current research has shown that the parallel execution
and co-operation of several (meta-)heuristics could improve the quality of
the solutions that each of them would be able to find by itself working on
a standalone basis. Moreover, parallel and distributed approaches can be
used to provide more powerful and robust problem solving environments in a
variety of problem domains. Hyper-heuristics, on the other hand, represent
a set of search methodologies which are applicable to different problem
domains. They aim to raise the level of generality, for example by
choosing and/or generating new methodologies on demand during the search
process. The goal of this study is to explore the cooperative search
mechanisms within a hyper-heuristic framework. This exciting research area
lies at the interface between operational research and computer science
and involves understanding of (distributed) decision making mechanisms and
learning, design, implementation and analysis of automated search
methodologies. The application domains will be cross disciplinary.

Students should have at least an upper second-class honours degree
(ideally a first class degree), or a combination of qualifications and/or
experience equivalent to that level.  Knowledge of agent based/distributed
computing, parallel processing and/or parallel/multi-core programming
experience is extremely desirable. Preferably, students should have an
undergraduate or Masters Degree in computer science, operational research,
mathematics or closely related area. Students with a mathematical
background and good programming experience are also encouraged to apply.

This studentship is available for 3 years and includes an approximate
maintenance grant of 13,300 per year, maintenance grant and UK/EU tuition
fees.

Informal enquiries may be addressed to Dr E Ozcan, see:
http://www.cs.nott.ac.uk/~exo/ or Email: [log in to unmask]  Please note
that applications sent direct to this email address will not be accepted.

To apply, please access:
http://pgstudy.nottingham.ac.uk/apply-for-postgraduate-courses.aspx.

Please quote ref. SCI/847.

Closing date: 25 June 2010.

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager