Titlebook: Computing and Combinatorics; First Annual Interna Ding-Zhu Du,Ming Li Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 1995 Co

angiography

Algorithmic graph embeddings,d shown to be superior to the previously known data structures. In particular, the new data structure efficiently supports all on-line operations for general graph embeddings. Based on this new data structure, very efficient algorithms are developed to solve the problem “given a graph . and an integ

PLUMP

Analysis of quorum-based protocols for distributed (k+1)-exclusion,ums of varying sizes and availabilities indexed by integral divisors . of .. The cases .=1 and . correspond to known majority based quorum generation algorithms . and ., whereas intermediate values of . interpolate between these two extremes. A cost and availability analysis of the proposed methods

notification

A highly fault-tolerant quorum consensus method for managing replicated data,ly applied to managing replicated data. In this paper, we present a new QC method. The proposed QC approach has a low message overhead: 1) In the best case, each transaction operation process needs only to communicate with . remote sites (. is the number of sites storing the manipulating data item).

Kaleidoscope

Constructing Craig interpolation formulas,nstructing a Craig interpolant from a refutation proof which involves binary resolution, paramodulation, and factoring. This method can solve the machine learning problem of discovering a first order concept from given examples. It can also be used to find sentences which distinguish pairs of noniso

addition

thwart

有效

botany

Thermodynamik für Maschinenbauerable in time .(n. n.). The same asymptotic bounds are observed for the corresponding problems where topological imbedding and subgraph homeomorphism are respectively substituted for subgraph isomorphism.

Admire

anus928