502 search results - page 11 / 101 » Verifying Balanced Trees |
MICRO
2010
IEEE
13 years 6 months ago
2010
IEEE
We propose an architectural design methodology for designing formally verifiable cache coherence protocols, called Fractal Coherence. Properly designed to be fractal in behavior, t...
ISSTA
2000
ACM
14 years 4 days ago
2000
ACM
ions for concise and precise specification of such control, but balance this with visualization support to help users also obtain intuitive insights. The underlying complexhese con...
MOBIDE
2010
ACM
13 years 8 months ago
2010
ACM
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
GCB
2007
Springer
14 years 2 months ago
2007
Springer
: There are several models for the evolutionary process forming a species tree. We examine the Birth-and-Death model (BDM), the Proportional-to-Distinguishable Arrangements (PDA) m...
CPM
2004
Springer
14 years 1 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...