Sciweavers

134 search results - page 4 / 27
» An Optimal Rebuilding Strategy for an Incremental Tree Probl...
Sort
View
FGCS
2000
81views more  FGCS 2000»
13 years 5 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
JUCS
2008
172views more  JUCS 2008»
13 years 5 months ago
A Hybrid Transgenetic Algorithm for the Prize Collecting Steiner Tree Problem
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
ICTAI
2005
IEEE
13 years 11 months ago
Subgoal Ordering and Granularity Control for Incremental Planning
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
Chih-Wei Hsu, Yixin Chen
ALDT
2009
Springer
181views Algorithms» more  ALDT 2009»
13 years 12 months ago
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
Gildas Jeantet, Olivier Spanjaard
ICPPW
2003
IEEE
13 years 10 months ago
A Fault-tolerant Routing Strategy for Gaussian Cube Using Gaussian Tree
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of ...
Loh Peter, Xinhua Zhang