Results 51 to 60 of about 1,237,463 (291)
Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems [PDF]
, 2012 We introduce an algorithm design technique for a class of combinatorial optimization problems with concave costs. This technique yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists for the fixed-
Magnanti, Thomas L., Stratila, Dan
core +2 more sources
An Exact Algorithm for Any-flavor Lattice QCD with Kogut-Susskind Fermion [PDF]
, 2002 We propose an exact simulation algorithm for lattice QCD with dynamical Kogut-Susskind fermion in which the N_f-flavor fermion operator is defined as the N_f/4-th root of the Kogut-Susskind (KS) fermion operator.
Aoki S. +15 more
core +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Neuropsychological complications may impair the qualitative prognosis of patients with pediatric brain tumors. However, multifaceted evaluations cannot be conducted in all patients because they are time consuming and burdensome for patients.
Ami Tabata +9 more
wiley +1 more source
Exact Algorithms for Linear Matrix Inequalities [PDF]
SIAM Journal on Optimization, 2016 Let $A(x)=A\_0+x\_1A\_1+...+x\_nA\_n$ be a linear matrix, or pencil, generated by given symmetric matrices $A\_0,A\_1,...,A\_n$ of size $m$ with rational entries. The set of real vectors x such that the pencil is positive semidefinite is a convex semi-algebraic set called spectrahedron, described by a linear matrix inequality (LMI).
Henrion, Didier +2 more
openaire +4 more sources
The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm
Algorithms, 2020 Let G=(V,E) be an undirected graph with vertex set V and edge set E. A clique C of G is a subset of the vertices of V with every pair of vertices of C adjacent. A maximum clique is a clique with the maximum number of vertices. A tabu search algorithm for
Derek H. Smith +2 more
doaj +1 more source
Exact and heuristic algorithms for Space Information Flow. [PDF]
PLoS ONE, 2018 Space Information Flow (SIF) is a new promising research area that studies network coding in geometric space, such as Euclidean space. The design of algorithms that compute the optimal SIF solutions remains one of the key open problems in SIF.
Alfred Uwitonze +4 more
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction Adult‐onset Still's disease (AOSD) complicated by macrophage activation syndrome (MAS) carries substantial mortality. The role of therapeutic plasma exchange (TPE) remains uncertain. Methods We retrospectively analyzed patients with AOSD‐MAS treated with TPE at a single‐center.
Masataka Ueda +15 more
wiley +1 more source
On-the-fly Approximation of Multivariate Total Variation Minimization [PDF]
, 2016 In the context of change-point detection, addressed by Total Variation minimization strategies, an efficient on-the-fly algorithm has been designed leading to exact solutions for univariate data.
Abry, Patrice +3 more
core +2 more sources
FEBS Letters, EarlyView.Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
Exact algorithm for the problem of the minimum complete spanning tree of a divisible multiple graph
Моделирование и анализ информационных системWe study undirected multiple graphs of any natural multiplicity $k > 1$. There are edges of three types: ordinary edges, multiple edges, and multi-edges.
Alexander V. Smirnov
doaj +1 more source