Optimization Problems & meta-heuristics. REPOsitory of Combinatorial Optimization Problems & meta-heuristics (REPOCOP) Submission: Open. Further information: http://repocop.ruizvanoye.com Repositories are being deployed in a variety of business settings (learning, science, research, cultural heritage) and across a range of scales (subject, national, regional, institutional, project, laboratory, personal). A key aim of the call REPOCOP 2010 is to request information on subjects related to the Combinatorial Optimization Problems (COP) and the meta-heuristic algorithms for create a collection of instances, algorithms, references to students and researchers of combinatorial optimization & meta-heuristics. Each submission should describe: - A combinatorial optimization problem (COP). - The instances or cases of COP. - Meta-heuristic algorithm for COP. -The code of the meta-heuristic algorithm for COP. -The reference to the paper with the results obtained for the meta- heuristic algorithm and the COP. -The name, institution, e-mail, and personal web page of the author (s). Please send a mail to: Dr. Ruiz-Vanoye, if you want to colaborate with this repository: REPOsitory of Combinatorial Optimization Problems & meta-heuristics (REPOCOP). Dr. Jorge A. Ruiz-Vanoye jorge @ ruizvanoye.com http://www.ruizvanoye.com Other posts:
• [ANN] DW Data Concepts announces fmWebMaze.com
• Indici • Keyword search in spatial database • schema versioning... best practices... ideas • FirstSQL/J 3.20 Embedded Mobile RDBMS for JME • Call for Repository Content about Combinatorial Optimization Problems & meta-heuristics • IS 2010 (2nd Call) submissions until 8 January 2010 • Finding tables in Open Office Base • Call for Papers: The 2010 International Conference on Information and Knowledge Engineering (IKE'10), USA, July 2010 • Virtual Japanese Blowjobs: Japan Nude Movie • [Oracle] Sql request |