Results 71 to 80 of about 367 (158)

Safe Stabilization Using Non‐Smooth Control Lyapunov Barrier Function

open access: yesInternational Journal of Robust and Nonlinear Control, Volume 36, Issue 11, Page 5823-5835, 25 July 2026.
ABSTRACT This paper addresses the challenge of safe stabilization, ensuring the system state reaches the origin while avoiding unsafe state regions. Existing approaches that rely on smooth Lyapunov barrier functions often fail to guarantee a feasible controller. To overcome this limitation, we introduce the non‐smooth control Lyapunov barrier function (
Jianglin Lan   +3 more
wiley   +1 more source

The critical complexity of all (monotone) boolean functions and monotone graph properties

open access: yesInformation and Control, 1985
CREW-PRAM's are a powerful model of parallel computers. Lower bounds for this model are rather general. \textit{S. A. Cook}, \textit{C. Dwork} and \textit{R. Reischuk} [SIAM J. Comput. 15, 87-97 (1986)] proved that the CREW-PRAM complexity of Boolean functions is bounded by \(\log_ b(f)\), where \(b\approx 4.79\) and c(f) is the critical complexity of ...
openaire   +1 more source

Computation of Immediate Neighbours of Monotone Boolean Functions

open access: yes
Boolean networks constitute relevant mathematical models to study the behaviours of genetic and signalling networks. These networks define regulatory influences between molecular nodes, each being associated to a Boolean variable and a regulatory (local) function specifying its dynamical behaviour depending on its regulators.
José E. R. Cury   +4 more
openaire   +2 more sources

Spontaneous emergence of computation in network cascades. [PDF]

open access: yesSci Rep, 2022
Wilkerson G, Moschoyiannis S, Jensen HJ.
europepmc   +1 more source

Monotone Circuit Lower Bounds from Robust Sunflowers. [PDF]

open access: yesAlgorithmica, 2022
Cavalar BP, Kumar M, Rossman B.
europepmc   +1 more source

Boolean network sketches: a unifying framework for logical model inference. [PDF]

open access: yesBioinformatics, 2023
Beneš N   +4 more
europepmc   +1 more source

Update rules and semantic universals. [PDF]

open access: yesLinguist Philos, 2023
Incurvati L, Sbardolini G.
europepmc   +1 more source

Functions computed by monotone boolean formulas with no repeated variables

open access: yesTheoretical Computer Science, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Home - About - Disclaimer - Privacy