Sciweavers

2313 search results - page 398 / 463
» On Heuristic Time Hierarchies
Sort
View
KI
2006
Springer
15 years 6 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
BMCBI
2004
156views more  BMCBI 2004»
15 years 6 months ago
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
Martin Schmollinger, Kay Nieselt, Michael Kaufmann...
JGAA
2002
86views more  JGAA 2002»
15 years 5 months ago
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
Christoph Dornheim
JPDC
1998
124views more  JPDC 1998»
15 years 5 months ago
Multilevel k-way Partitioning Scheme for Irregular Graphs
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
George Karypis, Vipin Kumar
CODES
2010
IEEE
15 years 4 months ago
Statistical approach in a system level methodology to deal with process variation
The impact of process variation in state of the art technology makes traditional (worst case) designs unnecessarily pessimistic, which translates to suboptimal designs in terms of...
Concepción Sanz Pineda, Manuel Prieto, Jos&...