Forwarding. 

 

From: Ceberio, Martine 



 

 

 

=================================================================
CALL FOR PAPERS 

CoProD'09

Workshop on Constraint Programming and Decision Making 
sponsored by NSF (CCF)
http://coprod.constraintsolving.com

UTEP, El Paso, Texas
November 9-10, 2009

Updated deadline: Sept. 28, 2009

=================================================================

CoProD'09 is the second edition of CoProD. 
CoProD'08 was held successfully in October 2008 at UTEP, bringing together 
about 30 researchers from constraint programming, optimization, and domain 
scientists. 

=================================================================

Constraint programming techniques are important components of intelligent 
systems. They constitute a nice and easy way to represent many practical 
situations. They have been applied successfully to a number of fields, such as 
scheduling of air traffic, software engineering, networks security, chemistry. 
Despite the proved usefulness of these techniques, they are still 
under-utilized in real-life projects. One reason might be the lack of effective 
communication of researchers with domain practitioners about constraints in 
general and their use in decision making in particular. 

Objectives of CoProD: 

*       To draw together a network of researchers interested in constraint 
techniques, in particular researchers and practitioners that use numeric and 
symbolic approaches (or a combination) to solve constraints 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 participants who participates in research in decision making 
/ constraint programming techniques, we expect to have a wide attendance of 
domain scientists for their input is extremely valued in this workshop.

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'09 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.

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 
tensors as a means to enhance existing solving algorithms and generate new ones.

Topics of interest (not limited to): 

*       Programs and algorithms reliability 
*       Algorithms and applications of: 

o Constraint solving, including symbolic-numeric algorithms

o Optimization: e.g., global, robust, multi-objective

o Tensors

o Interval arithmetic 

*       Description of domain applications that: 

o Require new decision making techniques

o Implement decision making techniques 

Invited Speakers:
* Carla Gomes, 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

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. 

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 (see 
instructions at http://www.springer.de/comp/lncs/authors.html). 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 <mailto:[email protected]> . A contact 
author should be specified in the submission email.
The deadline for submissions is September 28th  

Registration:
At least one author of each accepted paper must register and attend the 
workshop to present the paper. 

Registration fees are as follows: 

 

Early registration

Late registration 

Regular fee

$50

$100

Students' fee

$25

$70

Early registration is until October 20, 2009, and late registration anytime 
after that.

Important dates:
September 28: abstract submission 
October 5: notification of acceptance 
October 20: camera-ready copy of abstracts due AND end of early registration 
November 9-10: workshop

Organization
Main Organizer: Martine Ceberio, mceberio (at) utep (dot) edu.
Student Organizers: Paden Portillo, Adrian Franco

---
Martine Ceberio
Assistant Professor
Computer Science Department
University of Texas at El Paso
email: [email protected] 
<mailto:[email protected]://www.cs.utep.edu/mceberiohttp://www.constraintsolving.comtel>
 
http://www.cs.utep.edu/mceberio 
<mailto:[email protected]://www.cs.utep.edu/mceberiohttp://www.constraintsolving.comtel>
 
http://www.constraintsolving.com 
<mailto:[email protected]://www.cs.utep.edu/mceberiohttp://www.constraintsolving.comtel>
 
tel 
<mailto:[email protected]://www.cs.utep.edu/mceberiohttp://www.constraintsolving.comtel>
 : 915 747 6950
fax: 915 747 5030
_______________________________________________
uai mailing list
[email protected]
https://secure.engr.oregonstate.edu/mailman/listinfo/uai

Reply via email to