446 search results - page 36 / 90 » Extremal Stable Graphs |
153
click to vote
VLDB
1995
ACM
15 years 10 months ago
1995
ACM
: This paper defines a framework for explaining redo recovery after a system crash. In this framework, an installation graph explains the order in which operations must be install...
146
click to vote
EUROPAR
2007
Springer
16 years 23 days ago
2007
Springer
In this work we study preference systems suitable for the Peer-to-Peer paradigm. Most of them fall in one of the three following categories: global, symmetric and complementary. Al...
175
click to vote
LCTRTS
2009
Springer
16 years 1 months ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
145
click to vote
IJBC
2002
15 years 6 months ago
2002
We give a method for finding symbolic dynamics for a planar diffeomorphism with a homoclinic tangle. The method only requires a finite piece of tangle, which can be computed with ...
158
click to vote
MFCS
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...