The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
The space-time geometric structure of Maxwell’s equations is examined and a subset of them is found to define a pair of exact discrete time-stepping relations. The desirability ...
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
- We develop a numerical scheme for computing the solution of a generalized version of Fisher's equation. The main idea is to use a modi ed Crank-Nicolson method in order to c...
Miguel Olmos-Gomez, Merced Arriaga-Gutierrez, Vali...
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...