2555 search results - page 247 / 511 » Quantifiers and Working Memory |
143
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
128
click to vote
LCPC
2001
Springer
15 years 9 months ago
2001
Springer
While uniprocessor garbage collection is relatively well understood, experience with collectors for large multiprocessor servers is limited and it is unknown which techniques best ...
144
click to vote
SIGCOMM
1998
ACM
15 years 9 months ago
1998
ACM
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header elds of the packet such as source address,...
153
click to vote
HICSS
1995
IEEE
15 years 8 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
153
click to vote
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
Data prefetching technique is widely used to bridge the growing performance gap between processor and memory. Numerous prefetching techniques have been proposed to exploit data pa...