Sciweavers

2864 search results - page 305 / 573
» Constraint Programming in OPL
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Affine Systems of Equations and Counting Infinitary Logic
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
Albert Atserias, Andrei A. Bulatov, Anuj Dawar
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 9 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
AUTOMATICA
2002
104views more  AUTOMATICA 2002»
13 years 9 months ago
Who needs QP for linear MPC anyway?
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
Basil Kouvaritakis, Mark Cannon, J. Anthony Rossit...
JAIR
2010
99views more  JAIR 2010»
13 years 8 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
SIAMAM
2010
84views more  SIAMAM 2010»
13 years 8 months ago
Multidisciplinary Free Material Optimization
We present a mathematical framework for the so-called multidisciplinary free material optimization (MDFMO) problems, a branch of structural optimization in which the full material ...
Jaroslav Haslinger, Michal Kocvara, Günter Le...