Sciweavers

1381 search results - page 28 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
13 years 9 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia
DAC
2007
ACM
14 years 10 months ago
Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs
A key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks...
Maarten Wiggers, Marco Bekooij, Gerard J. M. Smit
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
13 years 10 months ago
Blocking parameterizations for improving the computational tractability of affine disturbance feedback MPC problems
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...
Frauke Oldewurtel, Ravi Gondhalekar, Colin Neil Jo...
IBERAMIA
2004
Springer
14 years 3 months ago
Constrainedness and Redundancy by Constraint Ordering
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
Miguel A. Salido, Federico Barber
MST
2008
124views more  MST 2008»
13 years 9 months ago
Complexity of Clausal Constraints Over Chains
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, G...