Results 41 to 50 of about 1,746,055 (248)

A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits

npj Quantum Information, 2022
We investigate the problem of synthesizing T-depth optimal quantum circuits for exactly implementable unitaries over the Clifford+T gate set. We construct a subset, $${{\mathbb{V}}}_{n}$$ V n , of T-depth 1 unitaries.
Vlad Gheorghiu, Michele Mosca, Priyanka Mukhopadhyay   +2 more
doaj   +1 more source

Safe Approximation—An Efficient Solution for a Hard Routing Problem

Algorithms, 2021
The Disjoint Connecting Paths problem and its capacitated generalization, called Unsplittable Flow problem, play an important role in practical applications such as communication network design and routing. These tasks are NP-hard in general, but various
András Faragó, Zohre R. Mojaveri
doaj   +1 more source

Characterization of Defect Distribution in an Additively Manufactured AlSi10Mg as a Function of Processing Parameters and Correlations with Extreme Value Statistics

Advanced Engineering Materials, EarlyView.
Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt, Varma Kvvssn, Hossein Laieghi, Zia Uddin, Peyman Ansari, E. Kıvanç Sadak, Can Barış Toprak, Hüseyin Kızıl, Enrico Salvati   +8 more
wiley   +1 more source

A Simple Algorithm for Consistent Query Answering under Primary Keys [PDF]

Logical Methods in Computer Science
We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e.
Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo   +3 more
doaj   +1 more source

On Optimistic and Pessimistic Bilevel Optimization Models for Demand Response Management

Energies, 2021
This paper investigates bilevel optimization models for demand response management, and highlights the often overlooked consequences of a common modeling assumption in the field.
Tamás Kis, András Kovács, Csaba Mészáros   +2 more
doaj   +1 more source

Wearable Smart Patches on Sustainable Chitosan With Reversible Microbial Growth‐Inhibitory Properties

Advanced Functional Materials, EarlyView.
ABSTRACT Chitosan, a polysaccharide upcycled from biowaste, has long promised sustainable, biocompatible, and antimicrobial films and devices, an appeal reinforced by its recent regulatory recognition, with several chitosan‐based antibacterial dressings gaining clearance through the Food and Drug Administration's 510(k) pathway.
Jacopo Nicoletti, Kubra Kocak, Andrea Michel, Enrico Cavarzerani, Ali Raza, Petr Rohzin, Nouha Loudhaief, Saimir Frroku, Nicolò Baldovin, Hazrat Bilal, Alvise Perosa, Maurizio Selva, Flavio Rizzolio, Luca Sbuelz, Sabrina Tamburini, Domenico De Fazio, Giovanni Antonio Salvatore   +16 more
wiley   +1 more source

An Improved Coppersmith Algorithm Based on Block Preprocessing

Mathematics
Since Coppersmith proposed the use of the LLL algorithm to solve univariate modular polynomial equations at EUROCRYPT’96, it has sparked a fervent research interest in lattice analysis among cryptographers.
Lu Zhang, Baodong Qin, Wen Gao, Yiyuan Luo   +3 more
doaj   +1 more source

A polynomial time biclustering algorithm for finding approximate expression patterns in gene expression time series

Algorithms for Molecular Biology, 2009
Background The ability to monitor the change in expression patterns over time, and to observe the emergence of coherent temporal responses using gene expression time series, obtained from microarray experiments, is critical to advance our understanding ...
Madeira Sara C, Oliveira Arlindo L
doaj   +1 more source

A subexponential-time, polynomial quantum space algorithm for inverting the CM group action

Journal of Mathematical Cryptology, 2020
We present a quantum algorithm which computes group action inverses of the complex multiplication group action on isogenous ordinary elliptic curves, using subexponential time, but only polynomial quantum space.
Jao David, LeGrow Jason, Leonardi Christopher, Ruiz-Lopez Luis   +3 more
doaj   +1 more source

Simultaneously dominating all spanning trees of a graph

Electronic Journal of Graph Theory and Applications, 2022
We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann, Sven O. Krumke, Manuel Streicher   +2 more
doaj   +1 more source