Sciweavers

1614 search results - page 169 / 323
» Breadth-First Heuristic Search
Sort
View
APDC
1997
15 years 6 months ago
A Parallel Algorithm for Optimal Task Assignment in Distributed Systems
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...
Ishfaq Ahmad, Muhammad Kafil
139
Voted
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 4 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
ECCC
2006
97views more  ECCC 2006»
15 years 4 months ago
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
Frank Neumann, Carsten Witt
GCB
2010
Springer
145views Biometrics» more  GCB 2010»
15 years 2 months ago
Shape-based Barrier Estimation for RNAs
: The ability of some RNA molecules to switch between different metastable conformations plays an important role in cellular processes. In order to identify such molecules and to p...
Sergiy Bogomolov, Martin Mann, Björn Voß...
156
Voted
ERCIMDL
2010
Springer
180views Education» more  ERCIMDL 2010»
15 years 2 months ago
SciPlore Xtract: Extracting Titles from Scientific PDF Documents by Analyzing Style Information (Font Size)
Extracting titles from a PDFs full text is an important task in information retrieval to identify PDFs. Existing approaches apply complicated and expensive (in terms of calculating...
Jöran Beel, Bela Gipp, Ammar Shaker, Nick Fri...