19 papers · ranked by Valyu relevance
Iztok Fister, Iztok Fister
The main deficiency of the algorithms running on digital computers nowadays is their inability to change themselves during the execution. In line with this, the paper introduces the so-called replicated algorithms, inspired by the concept of developing a human brain. Similar to the human brain, where the process of…
Andrey Grabovsky, Vitaly Vanchurin
We analyze algorithmic and computational aspects of biological phenomena, such as replication and programmed death, in the context of machine learning. We use two different measures of neuron efficiency to develop machine learning algorithms for adding neurons to the system (i.e. replication algorithm) and removing…
Hossein Esfandiari, Amin Karbasi, Vahab Mirrokni, Grigoris Velegkas + 1 more
'Felix Zhou'] We design replicable algorithms in the context of statistical clustering under the recently introduced notion of replicability from Impagliazzo et al. [2022]. According to this definition, a clustering algorithm is replicable if, with high probability, its output induces the exact same partition of the…
Nathan Ng, Hung Lê, Marco Serafini
Querying graph data with low latency is important in application domains such as social networks and knowledge graphs. Graph queries perform multiple hops between vertices. When data is partitioned and stored across multiple servers, queries executing at one server often need to hop to vertices stored by another…
Parwat Singh Anjana, Adithya Rajesh Chandrassery, Sathya Peri
Replicated tree data structures are extensively used in collaborative applications and distributed file systems, where clients often perform move operations. Local move operations at different replicas may be safe. However, remote move operations may not be safe. When clients perform arbitrary move operations…
Nour Mostafa, Yehia Kotb, Zakwan Al-Arnaout, Samer Alabed + 2 more
'Ahmed Younes Shdefat' 'Gregor Schiele'] The design and management of smart cities and the IoT is a multidimensional problem. One of those dimensions is cloud and edge computing management. Due to the complexity of the problem, resource sharing is one of the vital and major components that when enhanced, the…
Ahmed awad Mohamed, Laith Abualigah, Alhanouf Alburaikan, Hamiden Abd El-Wahed Khalifa + 1 more
'Hamiden Abd El-Wahed Khalifa' 'Marco Picone'] Recently, the concept of the internet of things and its services has emerged with cloud computing. Cloud computing is a modern technology for dealing with big data to perform specified operations. The cloud addresses the problem of selecting and placing iterations across…
W. A. Tiefenbrunner
Selection can be described as a process of information accumulation^21^. The present work extends this for frequency-dependent selection. For recombination, it is shown that the total entropy change can be calculated by summing the contributions of the individual gene loci in this case as well. For more complex…
Arun Kumar Sangaiah, Amir Javadpour, Pedro Pinto, Haruna Chiroma + 2 more
'Lubna A. Gabralla' 'Miguel Ángel Conde'] Answering a query through a peer-to-peer database presents one of the greatest challenges due to the high cost and time required to obtain a comprehensive response. Consequently, these systems were primarily designed to handle approximation queries. In our research, the primary…
Daniel J. Mankowitz, Andrea Michi, Anton Zhernov, Marco Gelmi + 26 more
'Marco Selvi' 'Cosmin Paduraru' 'Edouard Leurent' 'Shariq Iqbal' 'Jean-Baptiste Lespiau' 'Alex Ahern' 'Thomas Köppe' 'Kevin Millikin' 'Stephen Gaffney' 'Sophie Elster' 'Jackson Broshear' 'Chris Gamble' 'Kieran Milan' 'Robert Tung' 'Minjae Hwang' 'Taylan Cemgil' 'Mohammadamin Barekatain' 'Yujia Li' 'Amol Mandhane'…
Pelin Icer Baykal, Mike Simonov, Dhrithi Deshpande, Ful Belin Korukoglu + 8 more
Genomic research relies on accurate and reproducible computational analyses of DNA sequencing data to draw reliable biological conclusions. Read mapping, the process of aligning reads to a reference genome, is central to many applications, including variant detection and comparative genomics. While several tools have…
Rosie Berners-Lee, Eamonn Gilmore, Francisco Berkemeier, Michael A. Boemo + 1 more
'Michael A. Boemo' 'Vladimir B Teif'] In order to maintain genomic integrity, DNA replication must be highly coordinated. Disruptions in this process can cause replication stress which is aberrant in many pathologies including cancer. Despite this, little is known about the mechanisms governing the temporal regulation…
Xuemei Zhu, Chaochuan Jia, Jiangdong Zhao, Chunyang Xia + 4 more
'Ji Huang' 'Ling Li' 'Stanislav N. Gorb'] This paper presents an enhanced artificial lemming algorithm (EALA) for solving complex unmanned aircraft system (UAV) path planning problems in three-dimensional environments. Key improvements include chaotic initialization, adaptive perturbation, and hybrid mutation, enabling…
Finlay Clark, Graeme Robb, Daniel Cole, Julien Michel
Alchemical absolute binding free energy (ABFE) calculations have substantial potential in drug discovery, but are often prohibitively computationally expensive. To unlock their potential, efficient automated ABFE workflows are required to reduce both computational cost and human intervention. We present a…
Wilfried Agbeto, Camille Coti, Vladimir Reinharz
Advances in graph algorithmics have allowed in-depth study of many natural objects from molecular biology or chemistry to social networks. Particularly in molecular biology and cheminformatics, understanding complex structures by identifying conserved sub-structures is a key milestone towards the artificial design of…
Christoph Stelz, Lukas Hübner, Alexandros Stamatakis, Russell Schwartz
In Section 6.1, we evaluate the reproducibility of phylogenetic tree inferences on datasets from the TreeBASE () repository. For this, for each dataset, we execute the same RAxML-NG () application binary eight times, using identical hardware, search settings, and random seeds. For each of the eight runs we exclusively…
Tang, Maxwell, Hinkley, Garrett + 6 more
—Optimal routing in quantum-repeater networks requires finding the best path that connects a pair of end nodes. Most previous work on routing in quantum networks assumes utility functions that are isotonic, meaning that the ordering of two paths does not change when extending both with the same edge. However, we show…
Authors not listed
Machine olfaction—the artificial replication of the sense of smell—faces significant challenges due to the absence of large, standardized training datasets. Unlike vision, language, and audio models, which benefit from extensive corpora such as ImageNet, GLUE, and AudioSet, olfaction lacks scaled equivalents and…
Qi Zhang, Chang Liu, Stephen Wu, Ryo Yoshida
In the last few years, de novo molecular design using machine learning has made great technical progress but its practical deployment has not been as successful. This is mostly owing to the cost and technical difficulty of synthesizing such computationally designed molecules. To overcome such barriers, various methods…