1263 search results - page 128 / 253 » A* with Bounded Costs |
BMCBI
2010
13 years 9 months ago
2010
Background: Prostaglandin H2 (PGH2) is a common precursor for the synthesis of five different Prostanoids via specific Prostanoid Synthases. The binding of this substrate with the...
CC
2007
Springer
13 years 9 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
SIAMCO
2008
13 years 9 months ago
2008
The aim of this paper is to adapt the Viability Theorem from differential inclusions (governing the evolution of vectors in a finite dimensional space) to so-called morphological i...
IOR
2007
13 years 9 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
JISE
1998
13 years 9 months ago
1998
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. We build upon recent results by ...