Results 91 to 100 of about 128,668 (237)

Gaussian‐Sigmoid Reinforcement Transistors: Resolving Exploration‐Exploitation Trade‐Off Through Gate Voltage‐Controlled Activation Functions

Advanced Functional Materials, EarlyView.
The characteristics of a vertical n–p–i–p heterostructure transistor device, which exhibits a voltage‐tunable transition between Gaussian and sigmoid functions, are investigated. The mixed state of the transfer curve enables the utilization of both exploitation and exploration, improving computational performance in reinforcement learning tasks ...
Jisoo Park, Juhyung Seo, Ryun‐Han Koo, Dinithi Jayasuriya, Nethmi Jayasinghe, Wonjun Shin, Amit R. Trivedi, Hocheon Yoo   +7 more
wiley   +1 more source

Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems [PDF]

Logical Methods in Computer Science
We study the complexity of the model-checking problem for parameterized discrete-timed systems with arbitrarily many anonymous and identical processes, with and without a distinguished "controller", and communicating via synchronous rendezvous.
Benjamin Aminof, Sasha Rubin, Francesco Spegni, Florian Zuleger   +3 more
doaj   +1 more source

Parameterized complexity of machine scheduling: 15 open problems

, 2018
Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms.
Mnich, Matthias, van Bevern, René
core   +1 more source

On the Parameterized Complexity of Pooling Design [PDF]

Journal of Computational Biology, 2009
Pooling design is a very helpful tool for reducing the number of tests in DNA library screening, which is a key process to obtain high-quality DNA libraries for studying gene functions. Three basic problems in pooling design are, given an m x n binary matrix and a positive integer d, to decide whether the matrix is d-separable (d-separable, or d ...
Ding-Zhu Du, Ker I. Ko, Guohui Lin, Yongxi Cheng   +3 more
openaire   +3 more sources

SMaRT Stacking: A Methodology to Produce Optimally Layered EMI Shields with Maximal Green Index Using Fused Deposition Modeling

Advanced Functional Materials, EarlyView.
Electromagnetic interference (EMI) shields consisting of polylactic acid (PLA) in layers with different concentrations of multiwalled carbon nanotubes (MWCNT) are produced using additive manufacturing. The permittivity function of layers with different filler concentrations is learned using data of homogeneous and randomly ordered shields.
Stijn De Smedt, Brecht Evens, Pramod Ravichandran, Panagiotis Patrinos, Frederik Van Loock, Ruth Cardinaels   +5 more
wiley   +1 more source

Energy Distribution Optimization in Heterogeneous Networks with Min–Max and Local Constraints as Support of Ambient Intelligence

Sensors
In recent years, ambient intelligence (AmI) has gained significant attention from both academia and industry. AmI seeks to create environments that automatically adapt to individuals’ needs, improving comfort and efficiency.
Alessandro Aloisio, Domenico D. Bloisi, Marco Romano, Cosimo Vinci   +3 more
doaj   +1 more source

On the Parameterized Complexity of Consensus Clustering [PDF]

Theoretical Computer Science, 2011
Given a collection C of partitions of a base set S, the NP-hard Consensus Clustering problem asks for a partition of S which has a total Mirkin distance of at most t to the partitions in C, where t is a nonnegative integer. We present a parameterized algorithm for Consensus Clustering with running time O(4.24^k@?k^3+|C|@?|S|^2), where k:=t/|C| is the ...
Martin Dörnfelder, Christian Komusiewicz, Jiong Guo, Mathias Weller   +3 more
openaire   +2 more sources

Investigating Experimental Short Term Imprint Dynamics in Ferroelectric Hafnium Oxide Through Phase‐Field Modeling

Advanced Functional Materials, EarlyView.
Phase‐field modeling reveals the mechanisms behind short‐term ferroelectric imprint in Hf0.5Zr0.5O2 polycrystalline thin films. Combined with a charge trapping model, the proposed framework accurately reproduces coercive field shifts with pause time and their recovery through field cycling in polarization‐voltage measurements, offering valuable ...
Kévin Alhada‐Lahbabi, Benoit Manchon, Grégoire Magagnin, Chiara Lepri, Sara Gonzalez, Ingrid Cañero Infante, Martine Le Berre, Bertrand Vilquin, Jordan Bouaziz, Brice Gautier, Damien Deleruyelle   +10 more
wiley   +1 more source

Randomized Parameterized Algorithms for the Kidney Exchange Problem

Algorithms, 2019
In order to increase the potential kidney transplants between patients and their incompatible donors, kidney exchange programs have been created in many countries.
Mugang Lin, Jianxin Wang, Qilong Feng, Bin Fu   +3 more
doaj   +1 more source

Parameterized Complexity of Eulerian Deletion Problems [PDF]

Algorithmica, 2011
We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity of various versions: undirected or directed graphs, vertex or edge deletions, with or without the requirement of connectivity, etc.
Marek Cygan, niel Marx, Ildikó Schlotter, Marcin Pilipczuk, Pilipczuk, Micha   +5 more
openaire   +8 more sources