Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
This study evaluates appointment systems used in hospitals by incorporating appointment rules and patient characteristics. Using an experiment unit at an internal medicine departm...
We develop new algorithmic and cryptographic techniques for authenticating the results of queries over databases that are outsourced to an untrusted responder. We depart from previ...
Michael T. Goodrich, Roberto Tamassia, Nikos Trian...
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...