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

Help for CPHC-JOBS Archives


CPHC-JOBS Archives

CPHC-JOBS Archives


cphc-jobs@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

CPHC-JOBS Home

CPHC-JOBS Home

CPHC-JOBS  November 2013

CPHC-JOBS November 2013

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Call for Participation: The 2nd Cross-domain Heuristic Search Challenge - CHeSC 2014

From:

Jose Carlos Ortiz Bayliss <[log in to unmask]>

Reply-To:

Jose Carlos Ortiz Bayliss <[log in to unmask]>

Date:

Thu, 28 Nov 2013 10:12:49 -0800

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (41 lines)

[Please circulate to all those who might be interested, and accept our apologies if you received multiple copies of this announcement.]

The Second Cross-domain Heuristic Search Challenge - CHeSC 2014           
www.hyflex.org/chesc2014/

The CHeSC series seeks to bring together practitioners from operational research, computer science and artificial intelligence who are interested in developing more general and reusable methods for automated search control; doing so using hyper-heuristics that can be applied without modification to solve a wide range of instances from different problem domains. In CHeSC 2011, the hyper-heuristic was used to solve each instance separately and independently in a fixed time.  

CHeSC 2014 uses a "batch mode" in which the hyper-heuristic is given all the instances as a batch, together with a total time to solve them.  As before, the hyper-heuristic then needs to decide how to use the supplied low-level heuristics (move/neighbourhood operators) for the problem domain in order to provide a solution for each instance in the batch.  However, new challenges arise because the hyper-heuristic has the opportunity to:

* Decide how to allocate computational time between the instances

* Learn from some instances to be able to work better on others. 

To support these, some limited information about features of each instance (size and “kind”) is also made available to the hyper-heuristic.

The challenge is open now and with the deadline given below.

Competition Starts:   28 November 2013
Submission Deadline:  28 March 2014

Hence, you have four months to produce a "batch mode hyper-heuristic" that is able to solve a set of instances associated with multiple domains. 

To encourage transition towards exploitation of multi-core machines, the competition has two tracks:

1) "Single-solver mode" - only one solver is allowed to run at a time.

2) "Multiple-solver mode" - multiple solvers are allowed to exploit the multiple cores of machine that will be used for evaluation.

In total, £1,200 will be given as prizes to the implementers of top ranking algorithms in the competition.

Sponsors:

-The Automated Scheduling, Optimisation and Planning (ASAP) research group (www.asap.cs.nott.ac.uk)
-The LANCS Initiative (www.lancs-initiative.ac.uk)

Please consult the webpage www.hyflex.org/chesc2014/
If you have any questions, please do not hesitate to contact us at [log in to unmask] 

On behalf of the organisers,
Jose Carlos Ortiz-Bayliss

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

March 2024
January 2024
December 2023
November 2023
September 2023
August 2023
April 2023
February 2023
January 2023
November 2022
August 2022
June 2022
April 2022
January 2022
August 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
February 2020
January 2020
December 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
December 2018
November 2018
October 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
July 2017
May 2017
March 2017
February 2017
January 2017
December 2016
October 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
December 2015
November 2015
September 2015
August 2015
June 2015
May 2015
April 2015
March 2015
February 2015
December 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
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
October 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
November 2009
August 2009
July 2009
June 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
February 2008
January 2008
December 2007
October 2007
August 2007
July 2007
April 2007
March 2007
November 2006
June 2006
February 2006
September 2005
August 2005
July 2005
June 2005
May 2005
March 2005
November 2004
October 2004
September 2004
June 2004
May 2004
April 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
January 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001
April 2001
March 2001
February 2001
January 2001
December 2000
November 2000
October 2000
September 2000
August 2000
July 2000
June 2000
May 2000
April 2000
March 2000
February 2000
January 2000
December 1999
November 1999
October 1999
September 1999
August 1999
July 1999
June 1999
May 1999
April 1999
March 1999
February 1999
January 1999
December 1998
November 1998
October 1998
September 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