Results 251 to 260 of about 41,334 (304)

Hopfield Neural Networks for Online Constrained Parameter Estimation With Time‐Varying Dynamics and Disturbances

International Journal of Adaptive Control and Signal Processing, EarlyView.
This paper proposes two projector‐based Hopfield neural network (HNN) estimators for online, constrained parameter estimation under time‐varying data, additive disturbances, and slowly drifting physical parameters. The first is a constraint‐aware HNN that enforces linear equalities and inequalities (via slack neurons) and continuously tracks the ...
Miguel Pedro Silva
wiley   +1 more source

Sensory and cognitive awareness impairment patterns in children with autism spectrum disorder: a factorial analysis of the underlying constructs. [PDF]

Child Adolesc Psychiatry Ment Health
Liyew WA, Moges A, Girma F, Abebe W, Afework M.   +4 more
europepmc   +1 more source

Fuzzy incidence coloring under structural operations for communication channel allocation. [PDF]

Sci Rep
Deji A, Wang Q, Zhou L.
europepmc   +1 more source

Pattern Learning and Knowledge Distillation for Single-Cell Data Annotation. [PDF]

Biology (Basel)
Zhang M, Ren B, Li X.
europepmc   +1 more source

Evidence for symbolic use of ochre by Micoquian Neanderthals in Crimea. [PDF]

Sci Adv
d'Errico F, Mauran G, Pitarch Martí A, Majkić A, Stepanchuk V.   +4 more
europepmc   +1 more source

Protocol for quantification of circulating immature granulocytes in patients with a chronic myeloid malignancy using flow cytometry. [PDF]

STAR Protoc
Morabito M, Solary E, Selimoglu-Buet D.
europepmc   +1 more source

Systemic and airway T cell dynamics with influenza-specific immune recovery by cystic fibrosis elexacaftor/tezacaftor/ivacaftor therapy. [PDF]

Respir Res
Mouchtaridi E, Kowalik A, Raineri EJM, Humbert M, Jägerstedt J, Bojarlind M, Nilsson K, Flodström-Tullberg M, Pincikova T, Sandberg JK.   +9 more
europepmc   +1 more source

List and total colorings of multiset permutation graphs [PDF]

Italo J. Dejter
openalex  

Some of the next articles are maybe not open access.

Related searches:

Uniquely Total Colorable Graphs

Graphs and Combinatorics, 1997
A total coloring of a graph is an assignment of colors to the vertices and edges of the graph so that no two adjacent edges have the same color, no two adjacent vertices have the same color and no vertex and an incident edge have the same color. The minimum number of colors needed by a total coloring is called the total chromatic number and is denoted \
Akbari, S., Behzad, M., Hajiabolhassan, H., Mahmoodian, E. S.   +3 more
openaire   +2 more sources

Total Colorings of Product Graphs

Graphs and Combinatorics, 2018
A proper total coloring of a graph \(G\) is an assignment of colors to vertices and edges of the graph, such that adjacent and incident elements receive different colors. The total chromatic number \(\chi^{\prime\prime}(G)\) of the graph \(G\) is the minimum number of colors needed for a proper total coloring.
Geetha, J., Somasundaram, K.
openaire   +2 more sources