Results 31 to 40 of about 1,007,914 (329)
Applied Sciences, 2019 The Expanded Douglas⁻Peucker (EDP) polygonal approximation algorithm and its application method for the Opposite Angle-Based Exact Cell Decomposition (OAECD) are proposed for the mobile robot path-planning problem with curvilinear obstacles.
Jin-Woo Jung +4 more
doaj +1 more source
An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
, 2009 We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location problem (UFL), which improves on the previously best known 1.52-approximation algorithm by Mahdian, Ye and Zhang.
Aardal, Karen, Byrka, Jaroslaw
core +2 more sources
A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem
, 2011 A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem.
C. Thielen +14 more
core +1 more source
Rounding in ¿-approximation algorithms
2006 Symposium on Communications and Vehicular Technology, 2006 A common approach to deal with NP-hard problems is to deploy polynomial-time ϵ-approximation algorithms. These algorithms often resort to rounding and scaling to guarantee a solution that is within a factor (1 + isin) of the optimal solution. Usually, researchers either only round up or only down.
openaire +4 more sources
Approximate Weak Greedy Algorithms [PDF]
Advances in Computational Mathematics, 2001 We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries.
Gribonval, Rémi, Nielsen, Morten
openaire +3 more sources
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Radio Mean Labeling Algorithm, Its Complexity and Existence Results
MathematicsRadio mean labeling of a connected graph G is an assignment of distinct positive integers to the vertices of G satisfying a mathematical constraint called radio mean condition. The maximum label assigned to any vertex of G is called the span of the radio
Meera Saraswathi +2 more
doaj +1 more source
A quantum algorithm for additive approximation of Ising partition functions
, 2014 We investigate quantum computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices.
Fujii, Keisuke +2 more
core +1 more source
Aggressive prostate cancer is associated with pericyte dysfunction
Molecular Oncology, EarlyView.Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero +11 more
wiley +1 more source
All-norm approximation algorithms [PDF]
Journal of Algorithms, 2002 Summary: A major drawback in optimization problems and in particular in scheduling problems is that for every measure there may be a different optimal solution. In many cases the various measures are different \(\ell_p\) norms. We address this problem by introducing the concept of an all-norm \(\rho\)-approximation algorithm, which supplies one ...
Azar, Yossi +3 more
openaire +5 more sources