Search Results for ""

A type of sale in which members of a group of buyers offer ever increasing amounts. The bidder making the last bid (for which no higher bid is subsequently made within a ...

"Aut" is the term applied in propositional calculus to the XOR connective. "Aut" is Latin form for "either/or (but not both)," e.g., "Aut Caesar aut nihil" (Cesare Borgia; ...

The average disorder number of a simple connected graph on n vertices is defined as the average length of a walk along the edges of the graph taken over all ordering of its ...

The average power of a complex signal f(t) as a function of time t is defined as <f^2(t)>=lim_(T->infty)1/(2T)int_(-T)^T|f(t)|^2dt, where |z| is the complex modulus (Papoulis ...

A pattern tau=(tau_1,...,tau_n) is said to avoid alpha=(alpha_1,...,alpha_k) if alpha is not contained in tau. In other words, tau avoids alpha iff no k-subset of tau is ...

For any set theoretic formula f(x,t_1,t_2,...,t_n), In other words, for any formula and set A there is a subset of A consisting exactly of those elements which satisfy the ...

The property of certain algorithms that accurate answers are returned for well-conditioned problems, and the inaccuracy of the answers returned for ill-conditioned problems ...

A procedure for finding the quadratic factors for the complex conjugate roots of a polynomial P(x) with real coefficients. (1) Now write the original polynomial as ...

A subset B of a vector space E is said to be balanced if lambdaB subset= B whenever lambda is a scalar satisfying |lambda|<=1. Here, the notation lambdaB denotes the set ...

The number of ways in which a group of n with weights sum_(i=1)^(n)w_i=1 can change a losing coalition (one with sumw_i<1/2) to a winning one, or vice versa. It was proposed ...