6045 search results - page 365 / 1209 » Computable Linearizations of Well-partial-orderings |
196
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit ...
178
click to vote
JAT
2006
15 years 7 months ago
2006
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...
156
click to vote
IJBC
2007
15 years 7 months ago
2007
Vanderbauwhede and van Gils, Krupa, and Langford studied unfoldings of bifurcations with purely imaginary eigenvalues and a nonsemisimple linearization, which generically occurs i...
192
click to vote
IJFCS
2007
15 years 7 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
215
click to vote
CCE
2005
15 years 7 months ago
2005
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...