Sciweavers

128 search results - page 3 / 26
» Ensuring Termination by Typability
Sort
View
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
13 years 7 months ago
Enlarging the domain of attraction of MPC controllers
This paper presents a method for enlarging the domain of attraction of nonlinear model predictive control (MPC). The usual way of guaranteeing stability of nonlinear MPC is to add...
Daniel Limón, T. Alamo, Eduardo F. Camacho
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
13 years 2 months ago
Distributed scheduling for air traffic throughput maximization during the terminal phase of flight
FAA's NextGen program aims at increasing the capacity of the national airspace, while ensuring the safety of aircraft. This paper provides a distributed merging and spacing al...
Rahul Chipalkatty, Philip Twu, Amir Rahmani, Magnu...
FUIN
2006
85views more  FUIN 2006»
13 years 7 months ago
Higher Order Deforestation
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
Geoff W. Hamilton
LPAR
2010
Springer
13 years 5 months ago
On Strong Normalization of the Calculus of Constructions with Type-Based Termination
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
Benjamin Grégoire, Jorge Luis Sacchini
CSL
2008
Springer
13 years 9 months ago
Type-Based Termination with Sized Products
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
Gilles Barthe, Benjamin Grégoire, Colin Rib...