Results 61 to 70 of about 9,890,926 (378)
, 2017 For genetic algorithms using a bit-string representation of length~$n$, the general recommendation is to take $1/n$ as mutation rate. In this work, we discuss whether this is really justified for multimodal functions. Taking jump functions and the $(1+1)$
Doerr, Benjamin +3 more
core +1 more source
Competing Sudakov Veto Algorithms [PDF]
, 2016 We present a way to analyze the distribution produced by a Monte Carlo algorithm. We perform these analyses on several versions of the Sudakov veto algorithm, adding a cutoff, a second variable and competition between emission channels.
Kleiss, Ronald, Verheyen, Rob
core +3 more sources
FEBS Letters, EarlyView.This work presents the characterization of MvoDUF2193, a Methanococcus voltae (Mvo) protein from the domain of unknown function (DUF) 2193 family. We demonstrate that MvoDUF2193 binds a single [4Fe–4S] cluster per subunit and that cluster occupancy regulates the transition from an apo tetramer to a [4Fe–4S] monomeric form. This structural transition is
Emily M. Dieter +8 more
wiley +1 more source
Complementary Algorithms For Tableaux [PDF]
, 2000 We study four operations defined on pairs of tableaux. Algorithms for the first three involve the familiar procedures of jeu de taquin, row insertion, and column insertion.
Roby, Tom +3 more
core +3 more sources
FEBS Letters, EarlyView.In this work, we reveal how different enzyme binding configurations influence the fluorescence decay of NAD(P)H in live cells using time‐resolved anisotropy imaging and fluorescence lifetime imaging microscopy (FLIM). Mathematical modelling shows that the redox states of the NAD and NADP pools govern these configurations, shaping their fluorescence ...
Thomas S. Blacker +8 more
wiley +1 more source
Analysis of Algorithms and Partial Algorithms [PDF]
, 2016 We present an alternative methodology for the analysis of algorithms, based on the concept of expected discounted reward. This methodology naturally handles algorithms that do not always terminate, so it can (theoretically) be used with partial algorithms for undecidable problems, such as those found in artificial general intelligence (AGI) and ...
openaire +3 more sources
Soft document clustering using a novel graph covering approach
BioData Mining, 2018 Background In text mining, document clustering describes the efforts to assign unstructured documents to clusters, which in turn usually refer to topics. Clustering is widely used in science for data retrieval and organisation.
Jens Dörpinghaus +2 more
doaj +1 more source
Analysis of an algorithm catching elephants on the Internet [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 The paper deals with the problem of catching the elephants in the Internet traffic. The aim is to investigate an algorithm proposed by Azzana based on a multistage Bloom filter, with a refreshment mechanism (called $\textit{shift}$ in the present paper),
Yousra Chabchoub +3 more
doaj +1 more source
Development of visible light‐sensitive human neuropsin (OPN5) via single amino acid substitution
FEBS Letters, EarlyView.The present study determines a key amino acid residue, Lys91, for defining UV sensitivity of human OPN5. Heterologous action spectroscopy of the wild type and K91 mutants of OPN5 in HEK293T cells reveals that substitution of Lys91 with neutral (alanine) or acidic amino acids (glutamic or aspartic acids) causes substantial shifts in spectral sensitivity
Yusuke Sakai +2 more
wiley +1 more source
An algorithm for the T-countAn algorithm for the T-count
Quantum Information and Computation, 2014 We consider quantum circuits composed of Clifford and $T$ gates. In this context the $T$ gate has a special status since it confers universal computation when added to the (classically simulable) Clifford gates. However it can be very expensive to implement fault-tolerantly.
Michele Mosca +3 more
openaire +3 more sources