Presentation 2012-01-27
Research Cases on Interval Constraint Programming : A Projection Method for Under-Constrained Problems and a Precise Simulation Method for Hybrid Systems
Daisuke ISHII,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Interval constraint programming is a framework for describing various phenomena with constraints that involve variables on the continuous domain, and for solving the constraints rigorously based on the interval computation. The topics of interval constraint programming include the BranchAndPrune algorithm for solving constraints, extensions to the interval Newton method, and reduction of the wrapping effect using parallelotope. This paper describes the two recent research cases on interval constraint programming.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) interval constraint programming / projection methods / hybrid systems / parallelotope methods
Paper # MSS2011-67,SS2011-52
Date of Issue

Conference Information
Committee MSS
Conference Date 2012/1/19(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Mathematical Systems Science and its applications(MSS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Research Cases on Interval Constraint Programming : A Projection Method for Under-Constrained Problems and a Precise Simulation Method for Hybrid Systems
Sub Title (in English)
Keyword(1) interval constraint programming
Keyword(2) projection methods
Keyword(3) hybrid systems
Keyword(4) parallelotope methods
1st Author's Name Daisuke ISHII
1st Author's Affiliation National Institute of Informatics()
Date 2012-01-27
Paper # MSS2011-67,SS2011-52
Volume (vol) vol.111
Number (no) 405
Page pp.pp.-
#Pages 5
Date of Issue