Sciweavers

2519 search results - page 69 / 504
» cost 2007
Sort
View
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
15 years 6 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
JCO
2007
128views more  JCO 2007»
15 years 6 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...
NETWORKS
2007
15 years 5 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
EMNLP
2007
15 years 7 months ago
Incremental Dependency Parsing Using Online Learning
We describe an incremental parser that was trained to minimize cost over sentences rather than over individual parsing actions. This is an attempt to use the advantages of the two...
Richard Johansson, Pierre Nugues
EMNLP
2007
15 years 7 months ago
Inducing Search Keys for Name Filtering
This paper describes ETK (Ensemble of Transformation based Keys) a new algorithm for inducing search keys for name filtering. ETK has the low computational cost and ability to ...
Karl Branting