11017 search results - page 129 / 2204 » Closure Systems and their Structure |
ASPLOS
2004
ACM
14 years 1 months ago
2004
ACM
Tracing garbage collectors traverse references from live program variables, transitively tracing out the closure of live objects. Memory accesses incurred during tracing are essen...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
ECCC
2006
13 years 8 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
MOR
2008
13 years 8 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
IPTPS
2005
Springer
14 years 1 months ago
2005
Springer
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...