Sciweavers

114 search results - page 19 / 23
» Dynamic prediction of collection yield for managed runtimes
Sort
View
SPE
1998
129views more  SPE 1998»
15 years 6 months ago
Timing Trials, or the Trials of Timing: Experiments with Scripting and User-Interface Languages
This paper describes some basic experiments to see how fast various popular scripting and user-interface languages run on a spectrum of representative tasks. We found enormous var...
Brian W. Kernighan, Christopher J. Van Wyk
PLDI
2009
ACM
16 years 7 months ago
Efficiently and precisely locating memory leaks and bloat
Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their wo...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
WWW
2002
ACM
16 years 7 months ago
An event-condition-action language for XML
XML repositories are now a widespread means for storing and exchanging information on the Web. As these repositories become increasingly used in dynamic applications such as e-com...
James Bailey, Alexandra Poulovassilis, Peter T. Wo...
ICDE
1999
IEEE
143views Database» more  ICDE 1999»
16 years 8 months ago
Query Routing in Large-Scale Digital Library Systems
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the inc...
Ling Liu
IPPS
2008
IEEE
16 years 1 months ago
Absolute Slicing in Peer-to-peer Systems
Peer-to-peer (P2P) systems are slowly moving from application-specific architectures to a generic serviceoriented design framework. The idea is to allow a dynamic collection of P...
Alberto Montresor, Roberto Zandonati