Related papers: Cryptocurrency Time Series on the Binary Complexit…
Binary search finds a given element in a sorted array with an optimal number of $\log n$ queries. However, binary search fails even when the array is only slightly disordered or access to its elements is subject to errors. We study the…
A recently proposed exact algorithm for the maximum independent set problem is analyzed. The typical running time is improved exponentially in some parameter regions compared to simple binary search. The algorithm also overcomes the core…
Constructing realistic digital twins for applications such as training autonomous driving models requires the efficient allocation of real-world data, yet data sovereignty regulations present a major challenge. To address this, we tackle…
Network binarization emerges as one of the most promising compression approaches offering extraordinary computation and memory savings by minimizing the bit-width. However, recent research has shown that applying existing binarization…
Efficient inference of Deep Neural Networks (DNNs) on resource-constrained edge devices is essential. Quantization and sparsity are key techniques that translate to repetition and sparsity within tensors at the hardware-software interface.…
We study the temporal evolution of the market efficiency in the stock markets using the complexity, entropy density, standard deviation, autocorrelation function, and probability distribution of the log return for Standard and Poor's 500…
We propose an extended demand response program, based on ancillary service for supplying flexible electricity demand. In our proposed scheme, we suggest a broader management model to control the scheduling and power consumption of Bitcoin…
Few assets in financial history have been as notoriously volatile as cryptocurrencies. While the long term outlook for this asset class remains unclear, we are successful in making short term price predictions for several major crypto…
Motivated by applications in data center networks, in this paper, we study the problem of scheduling in an input queued switch. While throughput maximizing algorithms in a switch are well-understood, delay analysis was developed only…
A prescription to calculate the minimum number of bits needed for binary strip detector readout is presented. This permits a systematic analysis of the readout efficiency relative to this theoretical minimum number of bits. Different level…
This article investigates a bi-objective redundancy allocation problem (RAP) for repairable systems, defined as cost minimization and availability maximization. Binary decisions jointly select the number of components and the standby…
We consider an incremental variant of the rooted prize-collecting Steiner-tree problem with a growing budget constraint. While no incremental solution exists that simultaneously approximates the optimum for all budgets, we show that a…
Optimal sampling based motion planning and trajectory optimization are two competing frameworks to generate optimal motion plans. Both frameworks have complementary properties: Sampling based planners are typically slow to converge, but…
Transaction data from digital payment systems can be used to study economic processes in such detail that was not possible previously. Here, data from the Sarafu token network, a Community Inclusion Currency in Kenya, is analysed. During…
Most cryptocurrencies rely on Proof-of-Work (PoW) "mining" for resistance to Sybil and double-spending attacks, as well as a mechanism for currency issuance. Hashcash PoW has successfully secured the Bitcoin network since its inception,…
Systematic Investment Plans (SIPs) are a primary vehicle for retail equity participation in India, yet the impact of their intra-month timing remains underexplored. This study offers a 22-year (2003--2024) comparative analysis of SIP…
The aim of this paper is to analyse the Bitcoin in order to shed some light on its nature and behaviour. We select 9 cryptocurrencies that account for almost 75\% of total market capitalisation and compare their evolution with that of a…
In this work we advance the understanding of the fundamental limits of computation for Binary Polynomial Optimization (BPO), which is the problem of maximizing a given polynomial function over all binary points. In our main result we…
This paper presents a novel optimization approach for allocating grid operation costs in Peer-to-Peer (P2P) electricity markets using Quantum Computing (QC). We develop a Quadratic Unconstrained Binary Optimization (QUBO) model that matches…
We report on scaling and timing tests of the SIESTA electronic structure code for ab initio molecular dynamics simulations using density-functional theory. The tests are performed on six large-scale supercomputers belonging to the PRACE…