INTCP'06 Interval Analysis Constraint Propagation Applications Organizers : Christophe Jermann, Yahia Lebbah, Djamila Sam-Haroud Committee : Pedro Barahona,

Slides:

Advertisements

Similar presentations

Slides of the Invited Talk at the CAEPIA Workshop on Planning, Scheduling and Temporal Reasoning (Held on November 11, 2003 by Alexander Nareyek) Note.

Advertisements

Discrete variational derivative methods: Geometric Integration methods for PDEs Chris Budd (Bath), Takaharu Yaguchi (Tokyo), Daisuke Furihata (Osaka)

Optimal Instruction Scheduling for Multi-Issue Processors using Constraint Programming Abid M. Malik and Peter van Beek David R. Cheriton School of Computer.

Hybrid Discrete-Continuous Optimization for the Frequency Assignment Problem in Satellite Communications System Kata KIATMANAROJ, Christian ARTIGUES, Laurent.

Combining Symbolic Simulation and Interval Arithmetic for the Verification of AMS Designs Mohamed Zaki, Ghiath Al Sammane, Sofiene Tahar, Guy Bois FMCAD'07.

1 Numerical Solvers for BVPs By Dong Xu State Key Lab of CAD&CG, ZJU.

Programming with Constraints Jia-Huai You. Subject of Study Constraint Programming (CP) studies the computational models, languages, and systems for solving.

HYBRID SIMULATED ANNEALING AND DIRECT SEARCH METHOD FOR NONLINEAR UNCONSTRAINED GLOBAL OPTIMIZATION Abdel-Rahman Hedar and Masao Fukushima Speaker : UFO.

Better Ants, Better Life? Hybridization of Constraint Propagation and Ant Colony Optimization Supervisors: Bernd Meyer, Andreas Ernst Martin Held Jun 2nd,

An Approximation of Generalized Arc-Consistency for Temporal CSPs Lin Xu and Berthe Y. Choueiry Constraint Systems Laboratory Department of Computer Science.

A New Efficient Algorithm for Solving the Simple Temporal Problem Lin Xu & Berthe Y. Choueiry Constraint Systems Laboratory University of Nebraska-Lincoln.

Jean-Charles REGIN Michel RUEHER ILOG Sophia Antipolis Université de Nice – Sophia Antipolis A global constraint combining.

Network and Grid Computing –Modeling, Algorithms, and Software Mo Mu Joint work with Xiao Hong Zhu, Falcon Siu.

Iteration Technique toward SOC EDA Lab, Department of Computer Science and Technology, Tsinghua University

Michael Heusch - IntCP 2006 Modeling and solving of a radio antennas deployment support application with discrete and interval constraints.

12 April 2013Lecture 1: Interval Constraints Overview1 Interval Constraints Overview Jorge Cruz DI/FCT/UNL April 2013.

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Optimal Fixed-Size Controllers for Decentralized POMDPs Christopher Amato Daniel.

CS 561, Session 29 1 Belief networks Conditional independence Syntax and semantics Exact inference Approximate inference.

PDEs: General classification

Newton's Method for Functions of Several Variables

IntCP’06 Nantes - France, September 2006 Combining CP and Interval Methods for solving the Direct Kinematic of a Parallel Robot under Uncertainties C.

MULTISCALE COMPUTATIONAL METHODS Achi Brandt The Weizmann Institute of Science UCLA

Consistency Methods for Temporal Reasoning Lin XU Constraint Systems Laboratory Advisor: Dr. B.Y. Choueiry April, 2003 Supported by a grant from NASA-Nebraska,

26 April 2013Lecture 6: Problem Solving1 Problem Solving Jorge Cruz DI/FCT/UNL April 2013.

Distributed Constraint Optimization * some slides courtesy of P. Modi

Operations Research Models

Approximating the Algebraic Solution of Systems of Interval Linear Equations with Use of Neural Networks Nguyen Hoang Viet Michal Kleiber Institute of.

1 Hybrid methods for solving large-scale parameter estimation problems Carlos A. Quintero 1 Miguel Argáez 1 Hector Klie 2 Leticia Velázquez 1 Mary Wheeler.

1 A Domain Decomposition Analysis of a Nonlinear Magnetostatic Problem with 100 Million Degrees of Freedom H.KANAYAMA *, M.Ogino *, S.Sugimoto ** and J.Zhao.

Chapter 17 Boundary Value Problems. Standard Form of Two-Point Boundary Value Problem In total, there are n 1 +n 2 =N boundary conditions.

ME451 Kinematics and Dynamics of Machine Systems

Application of the Direct Optimized Probabilistic Calculation Martin Krejsa Department of Structural Mechanics Faculty of Civil Engineering VSB - Technical.

1 st International Joint Workshop on Computational Creativity Francisco C. Pereira Pablo Gervás Simon Colton.

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

Part 4 Nonlinear Programming 4.3 Successive Linear Programming.

Exploiting Automatically Inferred Constraint-Models for Building Identification in Satellite Imagery Research funded by the AFSOR, grant numbers FA

Mehdi Ghayoumi MSB rm 132 Ofc hr: Thur, a Machine Learning.

[1] National Institute of Science & Technology Technical Seminar Presentation Amit Kumar Das Roll#EC APPLICATIONS OF ANN IN MICROWAVE ENGINEERING.

Machine Learning Using Support Vector Machines (Paper Review) Presented to: Prof. Dr. Mohamed Batouche Prepared By: Asma B. Al-Saleh Amani A. Al-Ajlan.

USING PREFERENCE CONSTRAINTS TO SOLVE MULTI-CRITERIA DECISION MAKING PROBLEMS Tanja Magoč, Martine Ceberio, and François Modave Computer Science Department,

An Over View of Runge-Kutta Fehlberg and Dormand and Prince Methods. Numerical Methods To Solve Initial Value Problems William Mize.

Efficient Integration of Large Stiff Systems of ODEs Using Exponential Integrators M. Tokman, M. Tokman, University of California, Merced 2 hrs 1.5 hrs.

Decision Diagrams for Sequencing and Scheduling Andre Augusto Cire Joint work with David Bergman, Willem-Jan van Hoeve, and John Hooker Tepper School of.

Progress in identification of damping: Energy-based method with incomplete and noisy data Marco Prandina University of Liverpool.

Tanja Magoč, François Modave, Xiaojing Wang, and Martine Ceberio Computer Science Department The University of Texas at El Paso.

SWITCHING CONTROL DESIGN Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois at Urbana-Champaign.

Edge and Boundary interpretation Consistent line drawing labeling via backtracking Presented by Guy Shtub.

Solving an elliptic PDE using finite differences Numerical Methods for PDEs Spring 2007 Jim E. Jones.

Parallel Sessions: Compilers Moderator: Quinlan Panelists: Milind Kulkarni (Purdue), David Padua (UIUC), P. Sadayappan (Ohio State), Armando Solar-Lezama.

Survey of Kernel Methods by Jinsan Yang. (c) 2003 SNU Biointelligence Lab. Introduction Support Vector Machines Formulation of SVM Optimization Theorem.

Introduction to Scientific Computing II Overview Michael Bader.

Numerical Analysis. Numerical Analysis or Scientific Computing Concerned with design and analysis of algorithms for solving mathematical problems that.

CSE4334/5334 DATA MINING CSE4334/5334 Data Mining, Fall 2014 Department of Computer Science and Engineering, University of Texas at Arlington Chengkai.

MULTISCALE COMPUTATIONAL METHODS Achi Brandt The Weizmann Institute of Science UCLA

OR Integer Programming ( 정수계획법 ). OR

Department of Computer Science Undergraduate Events More

D Nagesh Kumar, IIScOptimization Methods: M8L1 1 Advanced Topics in Optimization Piecewise Linear Approximation of a Nonlinear Function.

Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.

Optimal Relay Placement for Indoor Sensor Networks Cuiyao Xue †, Yanmin Zhu †, Lei Ni †, Minglu Li †, Bo Li ‡ † Shanghai Jiao Tong University ‡ HK University.

1 Chapter 5 Branch-and-bound Framework and Its Applications.

Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller.

Wolfgang Runte Slide University of Osnabrueck, Software Engineering Research Group Wolfgang Runte Software Engineering Research Group Institute.

From Mixed-Integer Linear to Mixed-Integer Bilevel Linear Programming

Lecture #1 Introduction

Differential Evolution

Role and Potential of TAs for Industrial Scheduling Problems

Memetic Algorithms.

Seminar: “Control of autonomous vehicles” DATE: ,

Sampling based Mission Planning for Multiple Robots

Support Vector Machines

Presentation transcript:

INTCP'06 Interval Analysis Constraint Propagation Applications Organizers : Christophe Jermann, Yahia Lebbah, Djamila Sam-Haroud Committee : Pedro Barahona, Martine Ceberio, David Daney, Luc Jaulin, Stefan Ratschan, Nick Sahinidis, Josep Vehi

September 25 th 2006 Session 1 8:50Attraction domain of a non-linear system using interval analysis Nicolas Delanoue, Luc Jaulin, Betrand Cottenceau 9:10Test of injectivity via interval analysis Sébastien Lagrange, Nicolas Delanoue, Luc Jaulin 9:30 A note on some multivariate relaxations in global optimization Rouba Baroudi, Yahia Lebbah 9:50 Constructive interval disjunction Gilles Trombettoni, Gilles Chabert 10:10Intelligent splitting for disjunctive numerical CSPs Thomas Douillard, Christophe Jermann, Frédéric Benhamou Coffee break (10: :00) Session 2 11:00An interval-based approximation method for discrete changes in hybrid cc Daisuke Ishii, Kazunori Ueda, Hiroshi Hosobe 11:20 Computing inner approximations of numerical MaxCSP Marc Christie, Jean-Marie Normand, Charlotte Truchet 11:40 Combining CP and interval methods for solving the direct kinematic of a parallel robot under uncertainties Carlos Grandon, David Daney, Yves Papegay 12:00 Modeling and solving of a radio antennas deployment support application with discrete and interval constraints Michael Heusch Discussion on the goal of IntCP (ready your questions/remarks !) Program

September 25 th 2006 Post-workshop events Proceedings online Proceedings online Slides online Slides online Official post-proceedings (all CP workshops) by Hermes Science (selection of best full papers) Official post-proceedings (all CP workshops) by Hermes Science (selection of best full papers)

September 25 th 2006 Discussion Some trends in this edition: Some trends in this edition: Problems: MaxCSP, disjunctions, HybridCC, … Problems: MaxCSP, disjunctions, HybridCC, … Algorithms: constructive disjunction, relaxations, … Algorithms: constructive disjunction, relaxations, … Applications: robotics, antennas deployment, … Applications: robotics, antennas deployment, … Other hot topics: Other hot topics: Problems: Problems: discrete/continuous state systems (ODEs, PDEs, …) discrete/continuous state systems (ODEs, PDEs, …) diversity of objectives : decision, all solutions, representative solutions, best solution(s) w.r.t. one(several) criterion(a) diversity of objectives : decision, all solutions, representative solutions, best solution(s) w.r.t. one(several) criterion(a) Algorithms: combination of solvers SAT-CSP-NCSP-Math Algorithms: combination of solvers SAT-CSP-NCSP-Math Applications : model checking, … Applications : model checking, …  Representative of research directions?  Ultimate goal(s) of IntCP? Applications VS Theory/Algorithms Applications VS Theory/Algorithms Needs VS Characteristics (completeness, correctness, …) Needs VS Characteristics (completeness, correctness, …)

September 25 th 2006 Conclusion Thanks everyone ! See you in 2007 !