Search
Now showing items 1-2 of 2
Beyond Q-Resolution and Prenex Form: a Proof System for Quantified Constraint Satisfaction
(Technische Universität Braunschweig, Institute of Theoretical Computer Science, 2014)
We consider the quanti fied constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built from conjunction and quanti fication, whether ...
Pitch Based Wind Turbine Intelligent Speed Setpoint Adjustment Algorithms
(MDPI, 2014-06)
This work is aimed at optimizing the wind turbine rotor speed setpoint algorithm. Several intelligent adjustment strategies have been investigated in order to improve a reward function that takes into account the power ...