661 search results - page 11 / 133 » Argument Reduction by Factoring |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on ...
JCC
2006
13 years 9 months ago
2006
If a macromolecule is described by curvilinear coordinates or rigid constraints are imposed, the equilibrium probability density that must be sampled in Monte Carlo simulations in...
COCO
1989
Springer
14 years 1 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including impl...
WSC
2007
14 years 3 days ago
2007
Network reduction techniques are mainly used with exact approaches such as factoring to compute network reliability. However, exact computation of network reliability is feasible ...