Results 241 to 250 of about 892,017 (284)
Some of the next articles are maybe not open access.

Related searches:

Bilinear programming: An exact algorithm

Mathematical Programming, 1977
The Bilinear Programming Problem is a structured quadratic programming problem whose objective function is, in general, neither convex nor concave. Making use of the formal linearity of a dual formulation of the problem, we give a necessary and sufficient condition for optimality, and an algorithm to find an optimal solution.
Gallo G., Ulkucu A.
openaire   +6 more sources

Exact Langevin algorithms

Molecular Physics, 1992
In this paper the Hybrid Monte Carlo algorithm for condensed-matter systems is described as a generalized Langevin algorithm and compared to the Langevin scheme. Furthermore the parallel implementation of this class of algorithms is described.
B. Mehlig, D.W. Heermann, B.M. Forrest
openaire   +1 more source

Exact exponential algorithms

Communications of the ACM, 2013
Discovering surprises in the face of intractability.
Fedor V. Fomin, Petteri Kaski
openaire   +1 more source

Exact algorithms for Maximum Induced Matching

open access: yesInformation and Computation, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mingyu Xiao
exaly   +3 more sources

Exact Permutation/Randomization Tests Algorithms

Journal of Statistical Theory and Practice, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Exact Algorithms for Planted Motif Problems

Journal of Computational Biology, 2005
The problem of identifying meaningful patterns (i.e., motifs) from biological data has been studied extensively due to its paramount importance. Three versions of this problem have been identified in the literature. One of these three problems is the planted (l, d)-motif problem.
S, Rajasekaran, S, Balla, C-H, Huang
openaire   +2 more sources

Exact Linear Algebra Algorithmic

Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation, 2015
Exact linear algebra is a core component of many symbolic and algebraic computations, as it often delivers competitive theoretical complexities and also better harnesses the efficiency of modern computing infrastructures. In this tutorial we will present an overview on the recent advances in exact linear algebra algorithmic and implementation ...
openaire   +1 more source

Home - About - Disclaimer - Privacy