Sciweavers

4850 search results - page 764 / 970
» Approximate Data Structures with Applications
Sort
View
APLAS
2006
ACM
15 years 8 months ago
A Localized Tracing Scheme Applied to Garbage Collection
We present a method to visit all nodes in a forest of data structures while taking into account object placement. We call the technique a Localized Tracing Scheme as it improves lo...
Yannis Chicha, Stephen M. Watt
DASC
2006
IEEE
15 years 8 months ago
Automated Caching of Behavioral Patterns for Efficient Run-Time Monitoring
Run-time monitoring is a powerful approach for dynamically detecting faults or malicious activity of software systems. However, there are often two obstacles to the implementation...
Natalia Stakhanova, Samik Basu, Robyn R. Lutz, Joh...
ECRTS
2006
IEEE
15 years 8 months ago
Efficient Synchronization under Global EDF Scheduling on Multiprocessors
We consider coordinating accesses to shared data structures in multiprocessor real-time systems scheduled under preemptive global EDF. To our knowledge, prior work on global EDF h...
UmaMaheswari C. Devi, Hennadiy Leontyev, James H. ...
FQAS
2006
Springer
136views Database» more  FQAS 2006»
15 years 8 months ago
Robust Query Processing for Personalized Information Access on the Semantic Web
Abstract. Research in Cooperative Query answering is triggered by the observation that users are often not able to correctly formulate queries to databases that return the intended...
Peter Dolog, Heiner Stuckenschmidt, Holger Wache
ICSE
2000
IEEE-ACM
15 years 8 months ago
Software engineering and the Internet: a roadmap
We argue that a roadmap for software engineering and the Internet currently should be based on standards for complex data and document structures, like the Extensible Markup Langu...
Luca Bompani, Paolo Ciancarini, Fabio Vitali