Results 91 to 100 of about 103,423 (250)

Programmable Flocks: Hierarchical Swarm Control via Dynamic Parameter Injection

open access: yesAdvanced Intelligent Systems, EarlyView.
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

On super vertex-graceful unicyclic graphs [PDF]

open access: yes, 2009
summary:A graph $G$ with $p$ vertices and $q$ edges, vertex set $V(G)$ and edge set $E(G)$, is said to be super vertex-graceful (in short SVG), if there exists a function pair $(f, f^+)$ where $f$ is a bijection from $V(G)$ onto $P$, $f^+$ is a bijection
Lee, Sin-Min, Ng, Ho Kuen, Leung, Elo
core   +1 more source

Overcoming the Phase Discontinuity Problem in RIS Optimization: A Robust and Scalable Phase‐Aware Deep Regression Framework via Hybrid CNN–LSTM Architecture

open access: yesAdvanced Intelligent Systems, EarlyView.
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

On the graceful conjecture for triangular cacti

open access: yes, 2012
A graceful labelling of a graph with n edges is a vertex labelling where the induced set of edge weights is {1, . . . , n}. A near graceful labelling is almost the same, the difference being that the edge weights are {1, 2, . . . , n − 1, n + 1}. In both
Brenda Wicks   +3 more
core  

Crease‐Encoded Soft Origami Chambers: A Unified Design‐to‐Fabrication Framework for Low‐Pressure Pneumatic Joints

open access: yesAdvanced Intelligent Systems, EarlyView.
Origami turns a single silicone chamber into three different soft fluidic actuators. Crease angles alone decide whether it elongates, bends, or twists, and the fully folded chambers are cast monolithically in one day. Below 15 kPa, they reach 268% axial stretch, 72° bending, and 55° twist—no strain‐limiting layers, no rigid reinforcements, no vacuum ...
Alexia Le Gall   +4 more
wiley   +1 more source

Playing in the Dark: Invisible Chess as a Laboratory for Strategic AI

open access: yesAI &Innovation, EarlyView.
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

Exploring technologies to better link physical evidence and digital information for disaster victim identification. [PDF]

open access: yesForensic Sci Res, 2022
Lovell D   +5 more
europepmc   +1 more source

Essays on the Economics of Environmental and Sustainability Labelling [PDF]

open access: yes, 2013
Environmental protection, sustainability, and the combat against climate change are central topics for today’s societies. For reaching policy targets in any of these areas, it will be crucial to achieve far-ranging behaviour change in many respects ...
Schollenberg, Linda
core  

Graceful centers of graceful graphs and universal graceful graphs

open access: yes, 2019
In this paper we define graceful center of a graceful graph. We proved any graph G which admits α-labeling has at least four graceful centers. We also defined a new strong concept of universal graceful graph.
Makadia, H. M.   +2 more
core   +1 more source

On the application of graceful labelling in MPLS networks

open access: yes, 2018
Рассмотрены графовые модели на основе грациозных разметок, используемых при решении оптимизационных задач в современных сетях передачи данных.Мета статті.
Семенюта, М.Ф.   +1 more
core   +1 more source

Home - About - Disclaimer - Privacy