Sciweavers

1639 search results - page 174 / 328
» Anytime Heuristic Search
Sort
View
IJCAI
2001
13 years 11 months ago
Solving Factored MDPs via Non-Homogeneous Partitioning
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
Kee-Eung Kim, Thomas Dean
APDC
1997
13 years 11 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
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 10 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»
13 years 10 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»
13 years 8 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ß...