This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
We describe a Monte Carlo method for the numerical computation of the principal eigenvalue of the Laplace operator in a bounded domain with Dirichlet conditions. It is based on th...
Determining the hydrogen-deuterium exchange speeds of single residues from data for peptic fragments obtained by FT-ICS MS is currently mainly done by manual interpretation. We pr...
Ernst Althaus, Stefan Canzar, Mark R. Emmett, Andr...
Abstract-- Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based ...