|
|
Eighth International Conference on Sept. 8 - 13, 2002 Ithaca, NY, USA
|
|
|
Eighth International Conference on Sept. 8 - 13, 2002 Ithaca, NY, USA
|
Registration Form
Conference Program
Workshop Program
CP 2002 Poster
Poster Guidelines
Message about CP organizational rules
IMPORTANT HOTEL INFORMATION: The Holiday Inn room
block will only be held until August 12. Please make your reservations
before that date to ensure accommodations.
|
CP-2002 will be the eighth of the annual CP conference series. In addition to the Technical programme, we are pleased to continue the Innovative Applications programme and the Doctoral programme. We are also pleased to announce a special event, the Computational Symposium on Graph Coloring and Generalizations.
|
|
Deadline for paper submission |
These are strict deadlines. Papers arriving later than May 3 will not be reviewed.
Camera-ready copies arriving later than July 1 will not be included in the proceedings.
Papers must be original and not submitted for publication elsewhere.
Full length papers can be up to 15 proceedings pages and poster papers
can be up to 5 pages,
both in LNCS style. The LNCS style instructions and files can be obtained from
here. Oversized papers will be
rejected
without review. The proceedings will be published by Springer Verlag in the Lecture Notes in Computer
Science series.
The technical programme is concerned with all aspects of computing with constraints including: algorithms, applications, environments, languages, models, systems. Papers are solicited from any of the disciplines concerned with constraints, including: artificial intelligence, combinatorial algorithms, computational logic, concurrent computation, databases, discrete mathematics, engineering, operations research, programming languages, symbolic computation.
Papers may concern any of the domains using constraints, including: combinatorial auctions, computational linguistics, configuration, decision support, design, diagnosis, graphics, hardware verification, molecular biology, planning, program analysis, qualitative reasoning, real-time systems, resource allocation, robotics, satisfiability, scheduling, software engineering, temporal reasoning, type inference, vision, visualization, user interfaces. We especially welcome papers discussing novel reasoning and search methods, presenting original applications of constraint programming, building bridges between constraint programming and other areas, or providing fundamental theoretical insights in explaining the success or failure of existing methods.
The general Conference Programme is now available, with the abstracts of the accepted technical and innovative applications papers, the list of Poster Papers and the list of Doctoral Paper Presentations.
Innovative Applications is a programme under the Constraint Programming 2002 Conference. The Innovative Applications track is a forum for practitioners and end users of constraint technology, and an interface between them and researchers in constraints.
The purpose of this programme is to report successful applications of constraint technology, so as to attract potential users and researchers to this technology. Papers submitted to this track will mainly be judged by the success of applications reported. Authors may withhold confidential technical details if preferred.
We welcome submissions in, but not limited to, the following topics:
More information about the Innovative Applications programme can be found here.
A special programme for PhD students will be held alongside the conference. Students will be able to present their work and receive feedback from more senior members of the community. In addition, there will be tutorials about research skills and career issues. We hope to be able to announce details about financial support for participation in the doctoral programme in the near future.
Visit the general Conference Programme to locate the three sessions for the Doctoral Programme. You can also go directly to the list of Doctoral Paper Presentations.
More information about the doctoral programme can be found here.
CP2002 will include a series of workshops. The workshops will provide an informal setting where workshop participants will have the opportunity to discuss specific technical topics in an atmosphere that fosters the active exchange of ideas. Workshops are an opportunity to disseminate work in progress or to promote new and emerging areas within the field of constraints. The topics of the workshops can cover any area related to constraints and any related cross-disciplinary areas.
The Workshop Program is now available with a tentative schedule.
IMPORTANT DATES:
|
|
Deadline for paper submission |
These are strict deadlines. Papers arriving later than May 3 will not be reviewed. Camera-ready copies arriving later than July 1 will not be included in the proceedings. Papers must be original and not submitted for publication elsewhere. Full length papers can be up to 15 proceedings pages and poster papers can be up to 5 pages, both in LNCS style. The LNCS style instructions and files can be obtained from here. Oversized papers will be rejected without review. The proceedings will be published by Springer Verlag in the Lecture Notes in Computer Science series.
A Computational Symposium will be held in conjunction with CP-2002 at Cornell University. David Johnson, AT&T Labs, Anuj Mehrotra, University of Miami, and Michael Trick, Carnegie Mellon University, are the chairs of the Symposium. The purpose of this Symposium is to encourage research on computational methods for combinatorial optimization problems, to evaluate alternative approaches using a common testbed, and to stimulate discussion on present and future directions in computational combinatorial optimization. The Symposium will be on the topic "Graph Coloring and Generalizations". This topic was chosen due to the wide applicability of graph coloring and the variety of solution approaches that have been proposed. This symposium builds off of a DIMACS Computational Challenge from the fall of 1993, where graph coloring was one of the problems addressed. In addition to the basic graph coloring problem, results are also solicited for the related problems of "multi-coloring" (assigning multiple colors to each node) and bandwidth allocation models (those with minimum difference requirements on the colors on adjacent nodes).
More details about the Computational Symposium on Graph Coloring and Generalizations can be found here.
The conference will be held at the Robert Purcell Community Center at Cornell University's North Campus. For accommodations, a block of rooms have been set aside at the host hotel, the Holiday Inn. Please call the hotel directly for reservations and ask for the CU Conference CP02 group block. Room rates are $99-$109. IMPORTANT NOTE: The CP02 room block will only be held until August 12. Please make your reservations before that date to ensure accommodations. Shuttles will be provided from the Holiday Inn to the conference site.
Ithaca is located within the Finger Lakes region of New York State, a region where you can find a series of different wineries.
For arriving to the Ithaca Tompkins Regional Airport, you can travel first to one of the major connecting airports, such as Philadelphia International Airport or LaGuardia Airport (New York).
When arriving to the airport, you may want to take a taxi or rent a car:
| Conference Chair
Carla Gomes | Program Chair
Pascal Van Hentenryck |
| Chair of Innovative Applications
Programme
Helmut Simonis | Chair of Doctoral Programme
Francesca Rossi |
| Workshop Chair
Peter van Beek | Publicity Chair
Ramon Bejar |
| Local Arrangements
Beth Howard | |
| Program Committee | |
|
Slim Abdennadher, University of Munich |
Pedro Meseguer, IIIA-CSIC |
Computational Symposium on Graph Coloring and Generalizations
| Chairs | ||
|
David S. Johnson |
Anuj Mehrotra |
Michael Trick |
|
|
|
|
|
|
|
