Sciweavers

937 search results - page 135 / 188
» On the Complexity of Partial Order Properties
Sort
View
ICLP
2005
Springer
15 years 11 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
SSD
2005
Springer
116views Database» more  SSD 2005»
15 years 11 months ago
PA-Tree: A Parametric Indexing Scheme for Spatio-temporal Trajectories
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...
Jinfeng Ni, Chinya V. Ravishankar
ICCAD
2000
IEEE
124views Hardware» more  ICCAD 2000»
15 years 10 months ago
A Methodology for Verifying Memory Access Protocols in Behavioral Synthesis
— Memory is one of the most important components to be optimized in the several phases of the synthesis process. ioral synthesis, a memory is viewed as an abstract construct whic...
Gernot Koch, Taewhan Kim, Reiner Genevriere
OPODIS
2007
15 years 7 months ago
A Decentralized, Scalable, and Autonomous Grid Monitoring System
Abstract. Grid monitoring systems collect a substantial amount of information on the infrastructure’s status in order to perform various tasks, more commonly to provide a better ...
Laurent Baduel, Satoshi Matsuoka
PDCN
2007
15 years 7 months ago
An information service infrastructure for ambient networks
Communication environments are becoming increasingly more complex due to the diversity of available network technologies in terms of spatial coverage and design characteristics, a...
Raffaele Giaffreda, Kostas Pentikousis, Eleanor He...