Sciweavers

1464 search results - page 66 / 293
» Optimal Planning with ACO
Sort
View
EDBT
2012
ACM
247views Database» more  EDBT 2012»
11 years 10 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
14 years 8 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
ATMOS
2008
124views Optimization» more  ATMOS 2008»
13 years 9 months ago
Simultaneous Network Line Planning and Traffic Assignment
One of the basic problems in strategic planning of public and rail transport is the line planning problem to find a system of lines and its associated frequencies. The objectives o...
Karl Nachtigall, Karl Jerosch
CAEPIA
2005
Springer
14 years 1 months ago
Mapping Conformant Planning into SAT Through Compilation and Projection
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
Héctor Palacios, Hector Geffner
AIPS
2006
13 years 9 months ago
Goal Achievement in Partially Known, Partially Observable Domains
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
Allen Chang, Eyal Amir