Sciweavers

318 search results - page 41 / 64
» On the equivalence of linear complementarity problems
Sort
View
108
Voted
CPAIOR
2009
Springer
15 years 7 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...
ECP
1999
Springer
138views Robotics» more  ECP 1999»
15 years 4 months ago
Numeric State Variables in Constraint-Based Planning
We extend a planning algorithm to cover simple forms of arithmetics. The operator preconditions can refer to the values of numeric variables and the operator postconditions can mod...
Jussi Rintanen, Hartmut Jungholt
AUTOMATICA
2007
110views more  AUTOMATICA 2007»
15 years 18 days ago
Stability analysis of systems with uncertain time-varying delays
Stability in presence of bounded uncertain time-varying delays in the feedback loop of a system is studied. The delay parameter is assumed to be an unknown time-varying function f...
Chung-Yao Kao, Anders Rantzer
CCE
2008
15 years 17 days ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
DAM
2006
132views more  DAM 2006»
15 years 15 days ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler