Search Results for ""

A method of stochastic optimization including techniques such as gradient search or Robbins-Monro stochastic approximation.

There are a number of hypotraceable and hypohamiltonian graphs associated with Carsten Thomassen. These graphs, illustrated above, are implemented in the Wolfram Language as ...

A specific type of ultraproduct that can be used to construct nonstandard universes and obtain the transfer principle as a corollary of Łoś' theorem for ultraproducts.

A set of sample problems in unconstrained optimization is given by loading Optimization`UnconstrainedProblems` and evaluating $FindMinimumProblems.

A bicolorable graph G is a graph with chromatic number chi(G)<=2. A graph is bicolorable iff it has no odd graph cycles (König 1950, p. 170; Skiena 1990, p. 213; Harary 1994, ...

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

The Doyle graph, sometimes also known as the Holt graph (Marušič et al. 2005), is the quartic symmetric graph on 27 nodes illustrated above in several embeddings. It is ...

The function defined by y=ks^xb^(q^x) which is used in actuarial science for specifying a simplified mortality law (Kenney and Keeping 1962, pp. 241-242). Using s(x) as the ...

A polygon that can be dissected into n smaller copies of itself is called a rep-n-tile. The triangular polygonal spiral is also a rep-tile. The above figure shows the zeroth ...

Sprague (1963) considered the problem of "rolling" five cubes, each which an upright letter "A" on its top, on a chessboard. Here "rolling" means the cubes are moved from ...