974 search results - page 36 / 195 » pairing 2010 |
ECEASST
2010
13 years 5 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
CPC
2010
13 years 7 months ago
2010
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...
DM
2010
13 years 7 months ago
2010
We compute the generating function for triangulations on a cylinder, with the restriction that all vertices belong to its boundary and that the intersection of a pair of different ...
ENTCS
2006
13 years 7 months ago
2006
A logic for reasoning about states of basic quantum imperative programs is presented. The models of the logic are ensembles obtained by attaching probabilities to pairs of quantum...
IJBC
2010
13 years 5 months ago
2010
Curves of parameter values for which an asymptotic value of F,(z) = 1 + e-z lies on a pre-pole of arbitrary order are found through an iterative method. Some of these curves are sh...