13500 search results - page 2468 / 2700 » Improved analysis of D |
169
click to vote
ISCA
2009
IEEE
16 years 1 months ago
2009
IEEE
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
152
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
186
click to vote
ICIDS
2009
Springer
16 years 1 months ago
2009
Springer
Say Anything is a text-based interactive digital storytelling application that differs from other systems in its emphasis on the ability of users to create a narrative in any domai...
188
click to vote
IWMM
2009
Springer
16 years 1 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
192
click to vote
IWMM
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we investigate the effects of using three different nursery sizing policies on overall and garbage collection performances. As part of our investigation, we modify ...