Results 81 to 90 of about 1,405 (240)

Streaming Kernelization [PDF]

open access: yes, 2014
Kernelization is a formalization of preprocessing for combinatorially hard problems. We modify the standard definition for kernelization, which allows any polynomial-time algorithm for the preprocessing, by requiring instead that the preprocessing runs in a streaming setting and uses $\mathcal{O}(poly(k)\log|x|)$ bits of memory on instances $(x,k)$. We
Stefan Fafianie, Stefan Kratsch
openaire   +4 more sources

Investigation of Resonance Characteristics of More Than 10 000 Metal‐Coated Silicon MEMS Cantilevers Using Machine Learning

open access: yesAdvanced Engineering Materials, EarlyView.
More than 10 000 metal‐coated silicon MEMS cantilevers are fabricated and characterized to build a large‐scale experimental dataset spanning multiple vibrational modes. Machine learning algorithms are benchmarked to predict resonance frequency and quality factor, with ensemble based models achieving accuracy approaching experimental uncertainty.
Sina Zare Pakzad   +8 more
wiley   +1 more source

Parameterized Complexity of 1-Planarity

open access: yesJournal of Graph Algorithms and Applications, 2018
We consider the problem of drawing graphs with at most one crossing per edge. These drawings, and the graphs that can be drawn in this way, are called $1$-planar.
Michael Bannister   +2 more
doaj   +1 more source

Even Kernels

open access: yesThe Electronic Journal of Combinatorics, 1994
Given a graph $G = (V,E)$, an even kernel is a nonempty independent subset $V' \subseteq V$, such that every vertex of $G$ is adjacent to an even number (possibly 0) of vertices in $V'$. It is proved that the question of whether a graph has an even kernel is NP-complete. The motivation stems from combinatorial game theory.
openaire   +3 more sources

Memristive‐Gated RC‐Delay Synaptic Transistors for Time‐Encoded Analog in‐Memory Computing

open access: yesAdvanced Functional Materials, EarlyView.
A Memristive‐Gated Transistor for Time‐Encoded Analog In‐Memory Computing — By exploiting the RC delay of a self‐rectifying interface‐type memristor, nonlinear I–V distortion is structurally bypassed, enabling 3‐bit nonvolatile memory, spike‐timing‐based analog encoding, and hardware‐calibrated reservoir‐computing validation within a unified device ...
Yun‐Seo Shin   +7 more
wiley   +1 more source

Kernelization of Discrete Optimization Problems on Parallel Architectures [PDF]

open access: yes, 2022
There are existing standard solvers for tackling discrete optimization problems. However, in practice, it is uncommon to apply them directly to the large input space typical of this class of problems.
Saheed, Bolarinwa Olayemi
core  

Optimizing NiMo Electrocatalyst Coatings for Hydrogen Evolution in Alkaline Electrolysis With The Machine Learning‐Guided Autonomous Platform CatBot

open access: yesAdvanced Functional Materials, EarlyView.
This work presents a closed‐loop optimization workflow integrating CatBot, an automated synthesis and testing system, to discover NiMo hydrogen‐evolution catalysts. CatBot synthesised and evaluated 228 unique samples, identifying the best performing catalysts for transfer to nickel‐foam electrodes. The best candidate is highly active, reaching 1 Acm−2${
Paolo Vincenzo Freiesleben de Blasio   +7 more
wiley   +1 more source

(Meta) Kernelization

open access: yes, 2016
In a parameterized problem, every instance I comes with a positive integer k. The problem is said to admit a polynomial kernel if, in polynomial time, one can reduce the size of the instance I to a polynomial in k while preserving the answer.
Lokshtanov, D.   +5 more
core   +1 more source

Fine-grained Meta-Theorems for Vertex Integrity [PDF]

open access: yesLogical Methods in Computer Science
Vertex Integrity is a graph measure which sits squarely between two more well-studied notions, namely vertex cover and tree-depth, and that has recently gained attention as a structural graph parameter.
Michael Lampis, Valia Mitsou
doaj   +1 more source

Polynomial-time linear kernelization for cluster editing

open access: yes, 2007
In the cluster editing problem, a graph is to be changed to a disjoint union of cliques by at most k operations of edge insertion or edge deletion. Improving on the best previously known quadratic-size polynomial-time kernelization, we describe how a ...
Michael Langston (3446957)   +3 more
core  

Home - About - Disclaimer - Privacy