• Home
• 2008
• 2009
• 2010
• 2011
• 2012
• 2015
• 2016

Thanks to all speakers and participants of CoProD'11!!!

The workshop was a success thanks to all of you!

Coming soon: pictures of the workshop + presentations given at CoProD'11

Constraint programming techniques are important components of intelligent systems. They constitute a declarative and efficient methodology to represent and solve many practical problems. They have been applied successfully to a number of fields, such as scheduling of air traffic, software engineering, networks security, chemistry, and biology. Despite the proved usefulness of these techniques, they are still under-utilized in real-life applications. One reason is the perceived lack of effective communication between constraint programming experts and domain practitioners about constraints, in general, and their use in decision making, in particular.

CoProD'11 will be held on March 17, 2011, right before NAFIPS'11 (March 18-20) at the University of Texas at El Paso (UTEP), Texas.

Objectives of CoProD:

• To present advances in constraint solving, optimization, and related topics;
• To develop a network of researchers interested in constraint techniques, in particular researchers and practitioners that use numeric and symbolic approaches (or a combination of them) to solve constraint and optimization problems;
• To address the gap between the great capacity of these techniques and their limited use.

CoProD aims at encouraging presentation and discussion of on-going work. It also aims at facilitating networking opportunities as well as cross-fertilization between the approaches used in the different attending communities. Therefore, besides active researchers in decision making and constraint programming techniques, we expect to have a wide attendance and participation of domain scientists - whose input is highly valued in this workshop.

Special emphasis:

Although topics are by no mean restricted to the following, this year's edition of CoProD wants to specifically emphasize the topic of global optimization.
Topics of interest (not limited to):

• Programs and algorithms reliability
• Algorithms and applications of:
• Constraint solving, including symbolic-numeric algorithms
• Optimization: e.g., global, robust, multi-objective
• Tensors
• Interval arithmetic
• Description of domain applications that:
• Require new decision making techniques
• Implement decision making techniques

Expected outcomes of CoProD:

• Definition of new directions for combining numeric and symbolic approaches in solving constraints and optimization problems in particular and in decision making in general.
• Definition of new representations and abstractions (such as tensors) that are expected to enhance solving techniques and collaborations.
• Better connection between actual practitioners and researchers in constraints and decision making. CoProD'10 has the potential to impact these communities by easing collaborations and therefore the emergence of new techniques, and by creating a network of interest. The objectives of CoProD are also relayed all year round through the website http://constraintsolving.com.

CoProD has the potential to impact these communities by easing collaborations and therefore the emergence of new techniques, and by creating a network of interest. The objectives of CoProD are also relayed all year round through the website constraintsolving.com.

Invited Speakers and Program:

• Patty Hough, Sandia National Lab, Livermore CA
• Xiaobai Sun, Duke University
• Young Jun Son, The University of Arizona, Tucson
• Leticia Velazquez, The University of Texas at El Paso
• Enrico Pontelli, New Mexico State University, Las Cruces, NM
• Alessandro Dal Palu, University of Parma, Italy
• Francois Modave, Texas Tech Health Center, El Paso

The preliminary program of CoProD'11 is now available, as well as the booklet of abstracts.

The previous editions of CoProD featured invited talks by highly recognized experts, such as:

• Bart Selman, CS department, Cornell University
• Rina Dechter, Information and Computer Sciences, University of California Irvine
• Purushotham Bangalore, CIS department, University of Alabama at Birmingham
• James Raynolds, College of Nanoscale and Engineering, SUNY Albany
• Francois Modave, CS department, Central Washington University

Participation / Submission:

Participation is encouraged from people doing research in the area of decision making as well as from domain scientists. Submissions are expected in the form of extended abstracts of at least 2 pages and no more than 5 pages, formatted using the standard LNCS/LNAI format. The title page should include the name, address, and email address of each author as well as a list of keywords. Submissions have to be sent in postscript or pdf format AND latex format as well to mceberio [at] utep [dot] edu. A contact author should be specified in the submission email. The deadline for submissions is December 15.

Proceedings / Publication:

A book of abstracts will be printed and provided to each registered participant.
After the workshop, the program committee will invite the authors to submit a full article version of their work to be published (after a review process) in a Springer book series.

Important dates:

Organization

Location

UTEP, El Paso, Texas
Union Building, Acacia room (first floor of the Union Building)
Here is a detailed map of the campus
See the website of NAFIPS'2011 for information about the University and El Paso

Contact Info

Martine Ceberio
CoProD'2011
Department of Computer Science
The University of Texas at El Paso
500 West University
El Paso, TX 79968-0518
mceberio / utep -o- edu
 
 

Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.