Sciweavers

198 search results - page 34 / 40
» Colouring, constraint satisfaction, and complexity
Sort
View
DAC
2007
ACM
15 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»
14 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...
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
15 years 1 months ago
Evolutionary design of single-mode microstructured polymer optical fibres using an artificial embryogeny representation
Polymer microstructured optical fibres are a relatively recent development in optical fibre technology, supporting a wide variety of microstructure fibre geometries, when compared...
Steven Manos, Maryanne Large, Leon Poladian
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
15 years 10 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
CBSE
2009
Springer
15 years 4 months ago
Selecting Fault Tolerant Styles for Third-Party Components with Model Checking Support
To build highly available or reliable applications out of unreliable third-party components, some software-implemented fault-tolerant mechanisms are introduced to gracefully deal w...
Junguo Li, Xiangping Chen, Gang Huang, Hong Mei, F...