Results 71 to 80 of about 128,668 (237)
On Parameterized Exponential Time Complexity
Theoretical Computer Science, 2009 AbstractIn this paper we study the notion of parameterized exponential time complexity. We show that a parameterized problem can be solved in parameterized 2o(f(k))p(n) time if and only if it is solvable in time O(2δf(k)q(n)) for any constant δ>0, where p and q are polynomials.
Ge Xia, Iyad A. Kanj, Jianer Chen
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley +1 more source
Parameterized Complexity of the k-anonymity Problem
, 2010 The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization that has been recently proposed is the $k$-anonymity.
A Gionis +21 more
core +1 more source
Beyond Order: Perspectives on Leveraging Machine Learning for Disordered Materials
Advanced Engineering Materials, EarlyView.This article explores how machine learning (ML) revolutionizes the study and design of disordered materials by uncovering hidden patterns, predicting properties, and optimizing multiscale structures. It highlights key advancements, including generative models, graph neural networks, and hybrid ML‐physics methods, addressing challenges like data ...
Hamidreza Yazdani Sarvestani +4 more
wiley +1 more source
On Parameterized Complexity of Liquid Democracy [PDF]
, 2021 Submitted to 7th Annual International Conference on Algorithms and Discrete Applied Mathematics [CALDAM 2021]
Palash Dey, Arnab Maiti, Amatya Sharma
openaire +3 more sources
Advanced Engineering Materials, EarlyView.The role of various alloying elements in face‐centered cubic aluminum on the barrier of a Shockley partial dislocation during its motion is presented. The study aims to understand how alloying atoms such as Mg, Si, and Zr affect the energy landscape for dislocation motion, thus influencing the solid solution hardening and softening in aluminum, which ...
Inna Plyushchay +3 more
wiley +1 more source
Parameterized learning complexity [PDF]
Proceedings of the sixth annual conference on Computational learning theory - COLT '93, 1993 We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using parameterized problem reducibilities, we show that P -sized DNF (CNF) formulas can be exactly learned in time polynomial in the number of variables by extended equivalence queries ...
Michael R. Fellows +2 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.This study presents a 3D representative volume element‐based simulation approach to predict mesoscopic residual stress and strain fields in silicon solid solution‐strengthened ductile cast iron. By modeling phase transformation kinetics with an enhanced Johnson–Mehl–Avrami–Kolmogorov model, the effects of varying cooling rates on residual stresses are ...
Lutz Horbach +6 more
wiley +1 more source
Ural Mathematical Journal, 2016 The Hitting Set Problem (HSP) is the well known extremal problem adopting research interest in the fields of combinatorial optimization, computational geometry, and statistical learning theory for decades.
Daniel M. Khachay, Michael Yu. Khachay
doaj +1 more source
Polynomial fixed-parameter algorithms : a case study for longest path on interval graphs. [PDF]
, 2015 We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time. The main motivation is to get more efficient algorithms for problems with unattractive polynomial running times.
Giannopoulou, A.C. +4 more
core +4 more sources