Sciweavers

146 search results - page 19 / 30
» Cyclic reference counting
Sort
View
ALGOSENSORS
2009
Springer
14 years 4 months ago
Approximating Barrier Resilience in Wireless Sensor Networks
Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region S to some target region T will inte...
Sergey Bereg, David G. Kirkpatrick
SIGMETRICS
2004
ACM
103views Hardware» more  SIGMETRICS 2004»
14 years 3 months ago
Myths and realities: the performance impact of garbage collection
This paper explores and quantifies garbage collection behavior for three whole heap collectors and generational counterparts: copying semi-space, mark-sweep, and reference counti...
Stephen M. Blackburn, Perry Cheng, Kathryn S. McKi...
CCCG
2010
13 years 7 months ago
Determining the robustness of sensor barriers
Various notions of coverage provided by wireless sensor networks have attracted considerable attention over the past few years. In general, coverage can be expressed geometrically...
David G. Kirkpatrick
INFSOF
2010
113views more  INFSOF 2010»
13 years 8 months ago
Package Fingerprints: A visual summary of package interface usage
Context: Object-oriented languages such as Java, Smalltalk, and C++ structure their programs using packages. Maintainers of large systems need to understand how packages relate to...
Hani Abdeen, Stéphane Ducasse, Damien Polle...
WWW
2009
ACM
14 years 10 months ago
A search-based method for forecasting ad impression in contextual advertising
Contextual advertising (also called content match) refers to the placement of small textual ads within the content of a generic web page. It has become a significant source of rev...
Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Va...