9997 search results - page 1997 / 2000 » The case for crowd computing |
170
click to vote
STACS
2010
Springer
16 years 26 days ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
193
click to vote
ICS
2009
Tsinghua U.
16 years 19 days ago
2009
Tsinghua U.
The L2 cache is commonly managed using LRU policy. For workloads that have a working set larger than L2 cache, LRU behaves poorly, resulting in a great number of less reused lines...
180
click to vote
C5
2003
IEEE
15 years 11 months ago
2003
IEEE
SuperSwiki is a not yet well defined term. Its origins go back to Ward Cunningham's Wiki and its Squeak variant, the Swiki. It provides a place to share and edit web pages, f...
206
click to vote
DIALM
2003
ACM
15 years 11 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
194
click to vote
PLDI
1991
ACM
15 years 9 months ago
1991
ACM
o Authors of Extended Abstracts William Pugh Dept. of Computer Science and Institute for Advanced Computer Studies Univ. of Maryland, College Park March 16, 1993 This article stems...