Search Results for ""

A two-person game where each of the players can take as long as he likes to prepare his move, but the other can take advantage of his hesitation. In this conflict situation, ...

A method for numerical solution of a second-order ordinary differential equation y^('')=f(x,y) first expounded by Gauss. It proceeds by introducing a function delta^(-2)f ...

In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to graph entropies when studying a map of the Los Angeles while ...

An initial value problem is a problem that has its conditions specified at some time t=t_0. Usually, the problem is an ordinary differential equation or a partial ...

A method which can be used to solve the initial value problem for certain classes of nonlinear partial differential equations. The method reduces the initial value problem to ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

For a triangle DeltaABC and three points A^', B^', and C^', one on each of its sides, the three Miquel circles are the circles passing through each polygon vertex and its ...

A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...

A paradox in decision theory. Given two boxes, B1 which contains $1000 and B2 which contains either nothing or a million dollars, you may pick either B2 or both. However, at ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a path polynomial whose coefficients are the numbers of paths of ...