6045 search results - page 360 / 1209 » Computable Linearizations of Well-partial-orderings |
212
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise ...
165
Voted
ATAL
2006
Springer
15 years 11 months ago
2006
Springer
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
185
click to vote
CSR
2008
Springer
15 years 9 months ago
2008
Springer
Versus the customary preconditioners, our weakly random ones are generated more readily and for a much larger class of input matrices. Furthermore our preconditioners have a wider...
206
Voted
NC
2006
15 years 7 months ago
2006
Previously, we described ways to implement the functions AND and OR in a DNA computer consisting of microreactors with attached heating elements that control annealing of DNA. Base...
202
click to vote
ACTAC
2002
15 years 7 months ago
2002
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...