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...
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...
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...
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...
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...