Results 51 to 60 of about 9,322,932 (385)
A new polynomial-time algorithm for linear programming
Symposium on the Theory of Computing, 1984 We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n3.5L) arithmetic operations onO(L) bit numbers, wheren is the number of variables andL is the number of bits in the input.
N. Karmarkar
semanticscholar +1 more source
An investigation of edge F-index on fuzzy graphs and application in molecular chemistry
Complex & Intelligent Systems, 2022 The molecular descriptors are a useful tool in the spectral graph, molecular chemistry and several fields of chemistry and mathematics. The edge F-index is proposed for fuzzy graphs (FGs) here. Bounds of this index are calculated for FGs. The FG has been
Sk Rabiul Islam, Madhumangal Pal
doaj +1 more source
Deduplicating and Ranking Solution Programs for Suggesting Reference Solutions [PDF]
, 2023 Referring to solution programs written by other users is helpful for learners in programming education. However, current online judge systems just list all solution programs submitted by users for references, and the programs are sorted based on the submission date and time, execution time, or user rating, ignoring to what extent the programs can be ...
arxiv +1 more source
Constraint Programming viewed as Rule-based Programming
, 2001 We study here a natural situation when constraint programming can be entirely reduced to rule-based programming. To this end we explain first how one can compute on constraint satisfaction problems using rules represented by simple first-order formulas ...
Apt, Krzysztof R., Monfroy, Eric
core +4 more sources
Feature Selection Algorithms as One of the Python Data Analytical Tools
Future Internet, 2020 With the current trend of rapidly growing popularity of the Python programming language for machine learning applications, the gap between machine learning engineer needs and existing Python tools increases.
Nikita Pilnenskiy, Ivan Smetannikov
doaj +1 more source
The Reformulated F-Index of Vertex and Edge F-Join of Graphs
Journal of Chemistry, 2022 The valency based topological indices (TIs) are defined by algebraic functions as the chemical graph theory tools in which the structural parameters are used as input and the output is related with the topology of chemical species.
Durbar Maji +2 more
doaj +1 more source
Evolutionary programming made faster
IEEE Transactions on Evolutionary Computation, 1999 Evolutionary programming (EP) has been applied with success to many numerical and combinatorial optimization problems in recent years. EP has rather slow convergence rates, however, on some function optimization problems.
X. Yao, Yong Liu, Guangming Lin
semanticscholar +1 more source
Population Ecology, EarlyView.In the process of captive breeding and reintroduction of endangered animal species, it is crucial to minimize familial bias in reproductive success during the reintroduction phase to preserve genetic diversity. In this study, we attempted to identify the familial lineage of individuals of the endangered bagrid fish Tachysurus ichikawai born at the ...
Hinano Mizuno +5 more
wiley +1 more source
$\{log\}$: Set Formulas as Programs [PDF]
arXiv, 2021 $\{log\}$ is a programming language at the intersection of Constraint Logic Programming, set programming and declarative programming. But $\{log\}$ is also a satisfiability solver for a theory of finite sets and finite binary relations. With $\{log\}$ programmers can write abstract programs using all the power of set theory and binary relations.
arxiv
, 2014 Monads are a popular tool for the working functional programmer to structure effectful computations. This paper presents polymonads, a generalization of monads. Polymonads give the familiar monadic bind the more general type forall a,b. L a -> (a -> M b)
Bierman, Gavin +4 more
core +2 more sources