948 search results - page 28 / 190 » What can we achieve by arbitrary announcements |
MFCS
1994
Springer
13 years 11 months ago
1994
Springer
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We study the computational power of a distributed system consisting of simple autonomous robots moving on the plane. The robots are endowed with visual perception but do not have ...
JAIR
2012
11 years 10 months ago
2012
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
WIA
1997
Springer
13 years 11 months ago
1997
Springer
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
DATAMINE
2002
13 years 7 months ago
2002
Cubegrades are generalization of association rules which represent how a set of measures (aggregates) is affected by modifying a cube through specialization (rolldown), generaliza...