Sciweavers

2994 search results - page 290 / 599
» Time sequences
Sort
View
FLAIRS
2007
15 years 6 months ago
Case-Based Recommendation of Node Ordering in Planning
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...
Tomás de la Rosa, Angel García Olaya...
WSC
2008
15 years 6 months ago
Outpatient appointment scheduling in a multi facility system
This study evaluates appointment systems used in hospitals by incorporating appointment rules and patient characteristics. Using an experiment unit at an internal medicine departm...
Athula Wijewickrama, Soemon Takakuwa
CTRSA
2008
Springer
109views Cryptology» more  CTRSA 2008»
15 years 6 months ago
Super-Efficient Verification of Dynamic Outsourced Databases
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...
IPCO
2007
94views Optimization» more  IPCO 2007»
15 years 5 months ago
Infrastructure Leasing Problems
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...
Barbara M. Anthony, Anupam Gupta
MSV
2004
15 years 5 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
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...
Konstantin V. Shvachko