Sciweavers

6554 search results - page 969 / 1311
» Constraint Logic Programming
Sort
View
ENTCS
2002
99views more  ENTCS 2002»
15 years 4 months ago
Greatest Bisimulations for Binary Methods
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
Hendrik Tews
AUTOMATICA
2010
123views more  AUTOMATICA 2010»
15 years 3 months ago
On the computation of linear model predictive control laws
Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model Predictive ...
Francesco Borrelli, Mato Baotic, Jaroslav Pekar, G...
ACL
2010
15 years 3 months ago
Letter-Phoneme Alignment: An Exploration
Letter-phoneme alignment is usually generated by a straightforward application of the EM algorithm. We explore several alternative alignment methods that employ phonetics, integer...
Sittichai Jiampojamarn, Grzegorz Kondrak
151
Voted
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
15 years 2 months ago
A graph-theoretic approach to distributed control over networks
We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems ar...
John Swigart, Sanjay Lall
125
Voted
AOR
2010
15 years 2 months ago
Sphere Methods for LP
The sphere method for solving linear programs operates with only a subset of constraints in the model in each iteration, and thus has the advantage of handling instances which may...
Katta G. Murty, Mohammad R. Oskoorouchi