Sciweavers

3368 search results - page 348 / 674
» The Complexity of Query Reliability
Sort
View
LICS
2000
IEEE
15 years 11 months ago
Automatic Structures
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
Achim Blumensath, Erich Grädel
MOBICOM
1999
ACM
15 years 11 months ago
An Architecture for a Secure Service Discovery Service
The widespread deployment of inexpensive communications technology, computational resources in the networking infrastructure, and network-enabled end devices poses an interesting ...
Steven E. Czerwinski, Ben Y. Zhao, Todd D. Hodes, ...
EDBT
2010
ACM
125views Database» more  EDBT 2010»
15 years 10 months ago
A plan for OLAP
So far, data warehousing has often been discussed in the light of complex OLAP queries and as reporting facility for operative data. We argue that business planning as a means to ...
Bernhard Jaecksch, Wolfgang Lehner, Franz Faerber
FLAIRS
2007
15 years 9 months ago
Guiding Inference with Policy Search Reinforcement Learning
Symbolic reasoning is a well understood and effective approach to handling reasoning over formally represented knowledge; however, simple symbolic inference systems necessarily sl...
Matthew E. Taylor, Cynthia Matuszek, Pace Reagan S...
CCR
2004
89views more  CCR 2004»
15 years 6 months ago
Should we build Gnutella on a structured overlay?
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
Miguel Castro, Manuel Costa, Antony I. T. Rowstron