Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP pla...
The ray shooting problem arises in many different contexts and is a bottleneck of ray tracing in computer graphics. Unfortunately, theoretical solutions to the problem are not ver...
In Service Oriented Architecture, each application is ofgned as a set of abstract services, which defines its functions. A concrete service(s) is selected at runtime for tract ser...
We consider a monopolist expert offering a service with a `credence' characteristic. A credence service is one where the customer cannot verify, even after a purchase, whethe...
Laurens G. Debo, L. Beril Toktay, Luk N. Van Wasse...