Sciweavers

1204 search results - page 128 / 241
» Termination of Polynomial Programs
Sort
View
AUTOMATICA
2005
115views more  AUTOMATICA 2005»
15 years 19 days ago
Robust constrained predictive control using comparison model
This paper proposes a quadratic programming (QP) approach to robust model predictive control (MPC) for constrained linear systems having both model uncertainties and bounded distu...
Hiroaki Fukushima, Robert R. Bitmead
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
14 years 10 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
SCP
2011
255views Communications» more  SCP 2011»
14 years 7 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
111
Voted
ICALP
2009
Springer
15 years 7 months ago
Assigning Papers to Referees
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...
Kurt Mehlhorn
84
Voted
ICALP
2004
Springer
15 years 6 months ago
A Note on Karr's Algorithm
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
Markus Müller-Olm, Helmut Seidl