2:00 PM-4:00 PM
Room: Sidney Smith 1087
It is often important to have guaranteed results from computation. Usually, exact values are impossible, so we must produce intervals that contain the desired values. Computations leading to such guaranteed intervals are called interval computations.
The speakers in this minisymposium will discuss applications to robotics, where we must guarantee that robots do not bump into things; quantum mechanics, where we want guaranteed predictions of atomic properties; computer graphics, where we want graphical features only if data dictates them; and expert systems, where we don't want to deviate from the expert opinion range.Organizers: Vladik Kreinovich and Scott A. Starks