Sciweavers

1986 search results - page 120 / 398
» constraints 2006
Sort
View
AUTOMATICA
2006
73views more  AUTOMATICA 2006»
13 years 7 months ago
Robust MPC of constrained discrete-time nonlinear systems based on approximated reachable sets
A robust MPC for constrained nonlinear systems with uncertainties is presented. Outer bounds of the reachable sets of the system are used to predict the evolution of the system un...
J. M. Bravo, T. Alamo, Eduardo F. Camacho
EOR
2006
97views more  EOR 2006»
13 years 7 months ago
A simulated annealing and hill-climbing algorithm for the traveling tournament problem
The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M. Trick, The traveling tournament problem description and benchmarks, in: Proceedings of the 7th International Co...
Andrew Lim, Brian Rodrigues, X. Zhang
LOBJET
2000
134views more  LOBJET 2000»
13 years 7 months ago
Transparent Dynamic Database Evolution from Java
: With the increasing provision by the ODMG standard and commercial OODBMS products for transparent access to the traditional database functionality of an OODBMS from Java, there i...
Awais Rashid, Peter Sawyer
CADE
2006
Springer
14 years 8 months ago
Connection Tableaux with Lazy Paramodulation
It is well-known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tablea...
Andrey Paskevich
CORR
2006
Springer
128views Education» more  CORR 2006»
13 years 7 months ago
Generalizations of the Hanoi Towers Problem
Our theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goa...
Sergey Benditkis, Ilya Safro