Sciweavers

15485 search results - page 325 / 3097
» Computing Optimal Subsets
Sort
View
PDPTA
1996
15 years 8 months ago
Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
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...
Darrell R. Ulm, Johnnie W. Baker
IPL
2006
69views more  IPL 2006»
15 years 6 months ago
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
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 ...
André Große, Jörg Rothe, Gerd We...
MCS
2007
Springer
15 years 6 months ago
Computing the principal eigenvalue of the Laplace operator by a stochastic method
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...
Antoine Lejay, Sylvain Maire
SAC
2008
ACM
15 years 6 months ago
Computing H/D-exchange speeds of single residues from data of peptic fragments
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...
ASPDAC
2001
ACM
126views Hardware» more  ASPDAC 2001»
15 years 10 months ago
A new partitioning scheme for improvement of image computation
Abstract-- Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based ...
Christoph Meinel, Christian Stangier