Results 91 to 100 of about 29,676 (268)
A structural approach to the graceful coloring of a subclass of trees. [PDF]
D L, S DY.
europepmc +1 more source
An electro‐templating strategy directs the relaxation of cholesteric finger loops into discrete concentric rings whose geometry is electrically programmed. The photopolymerized structures retain the topological defect pattern and, upon heating, show reversible, castle‐like surface modulation.
Jacques A. Peixoto +4 more
wiley +1 more source
On the Role of Preprocessing and Memristor Dynamics in Reservoir Computing for Image Classification
ABSTRACT Reservoir computing (RC) is an emerging recurrent neural network architecture that has attracted growing attention for its low training cost and modest hardware requirements. Memristor‐based circuits are particularly promising for RC, as their intrinsic dynamics can reduce network size and parameter overhead in tasks such as time‐series ...
Rishona Daniels +4 more
wiley +1 more source
Graphic Groups, Graph Homomorphisms, and Graphic Group Lattices in Asymmetric Topology Cryptography. [PDF]
Zhao M, Wang H, Yao B.
europepmc +1 more source
Programmable Flocks: Hierarchical Swarm Control via Dynamic Parameter Injection
We present a method for the control of robot swarms which allows the shaping and the translation of patterns of simple robots (“smart particles”), using two types of devices. These two types represent a hierarchy: a larger group of simple, oblivious robots (which we call the workers) that is governed by simple local attraction forces and a smaller ...
Vivek Shankar Varadharajan +1 more
wiley +1 more source
The phase discontinuity problem—where the cyclic nature of phase angles causes catastrophic errors near the ±π boundary—is a fundamental obstacle in learning‐based reconfigurable intelligent surface (RIS) optimization. A phase‐aware hybrid CNN–LSTM framework resolves this by decomposing phase predictions into sine–cosine components, mapping circular ...
Seda Savaşçı Şen +3 more
wiley +1 more source
Playing in the Dark: Invisible Chess as a Laboratory for Strategic AI
This paper shows that strategic AI evaluated on perfect‐information benchmarks can be brittle in real adversarial settings. By using invisible chess as a benchmark for hidden state and deception, it argues for stricter testing, human oversight, and more cautious governance of high‐stakes AI systems.
Paolo Ciancarini
wiley +1 more source
Pelabelan Graceful Sisi-ganjil Pada Graf Web W(2,n) [PDF]
Let G = (V(G),E()) be a graph with vertex set () and edge set (). Assume that graph G have edge. Graceful edge-odd labeling is a bijective map ∶ () → {1, 3, 5,…,2 – 1} that resulting map + : () → {0,1,2,…,2 −1} with
Ratnasari, L. (Lucia) +2 more
core
Graceful Graphs and Graceful Labelings: Two Mathematical Programming Formulations and Some Other New Results [PDF]
Given a graph G consisting of vertices and edges, a vertex labeling of G is an assignment f of labels to the vertices of Gthat produces for each edge xy a label depending on the vertex labels f(x) and f(y).
Redl, Timothy A.
core
A graceful labeling of a graph G with m edges consists in labeling the vertices of G with distinct integers from 0 to m such that, when each edge is assigned the absolute difference of the labels of its endpoints, all induced edge labels are distinct ...
Dantas, Simone +2 more
core +1 more source

