Results 41 to 50 of about 10,477 (184)

Convergence of simple adaptive Galerkin schemes based on h − h/2 error estimators [PDF]

open access: yes, 2008
We discuss several adaptive mesh-refinement strategies based on (h − h/2)-error estimation. This class of adaptivemethods is particularly popular in practise since it is problem independent and requires virtually no implementational overhead.
Ortner, C.   +7 more
core   +1 more source

A strongly polynomial algorithm for the inverse shortest arborescence problem

open access: yesDiscrete Applied Mathematics, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhiquan Hu, Zhenhong Liu
openaire   +1 more source

A Faster Strongly Polynomial Minimum Cost Flow Algorithm [PDF]

open access: yesOperations Research, 1988
In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O(n log n) shortest path problems on networks with n nodes and m arcs and runs in O(n log n(m + n log n ...
openaire   +4 more sources

Fast Algorithm for High-Throughput Screening Scheduling Based on the PERT/CPM Project Management Technique

open access: yesAlgorithms
High-throughput screening systems are robotic cells that automatically scan and analyze thousands of biochemical samples and reagents in real time. The problem under consideration is to find an optimal cyclic schedule of robot moves that ensures maximum ...
Eugene Levner   +3 more
doaj   +1 more source

Determinantal Sieving [PDF]

open access: yesTheoretiCS
We introduce determinantal sieving, a new, remarkably powerful tool in the toolbox of algebraic FPT algorithms. Given a polynomial $P(X)$ on a set of variables $X=\{x_1,\ldots,x_n\}$ and a linear matroid $M=(X,\mathcal{I})$ of rank $k$, both over a field
Eduard Eiben   +2 more
doaj   +1 more source

Strongly Minimal Self-Conjugate Linearizations for Polynomial and Rational Matrices [PDF]

open access: yes, 2022
Funding Information: Funding: This work is part of the "Proyecto de I+D+i PID2019-106362GB-I00 financiado por MCIN/AEI/10.13039/501100011033." This work has been also funded by "Ministerio de Economía, Industria y Competitividad (MINECO)" of Spain ...
Quintana Ponce, María del Carmen   +7 more
core   +1 more source

Prediction of Radiation Frost Using Support Vector Machines Based on Micrometeorological Data

open access: yesApplied Sciences, 2019
Radiation frost happens frequently in the Yangtze River Delta region, which causes high economic loss in agriculture industry. It occurs because of heat losses from the atmosphere, plant and soil in the form of radiant energy, which is strongly ...
Yongzong Lu   +4 more
doaj   +1 more source

On modeling random data to evaluate the performance of statistical tests in cryptography

open access: yesInformatika
Objectives. Financial networks with a rule of constrained equal awards for the distribution of the agent’s estate between its creditors are considered. The aim of the study is to develop an algorithm for constructing greatest clearing matrices for such ...
U. Y. Palukha   +2 more
doaj   +1 more source

A strongly polynomial algorithm for line search in submodular polyhedra

open access: yesDiscrete Optimization, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

The Two Variable Per Inequality Abstract Domain [PDF]

open access: yes, 2010
This article presents the Two Variable Per Inequality abstract domain (TVPI domain for short). This so-called weakly-relational domain is able to express systems of linear inequalities where each inequality has at most two variables.
Howe, Jacob M., Simon, Axel, King, Andy
core   +1 more source

Home - About - Disclaimer - Privacy