130 search results - page 21 / 26 » The Complexity of Optimal Planning and a More Efficient Meth... |
CIKM
2010
Springer
13 years 2 months ago
2010
Springer
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
AAAI
2006
13 years 9 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
ICDCS
1999
IEEE
13 years 12 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...