2944 search results - page 258 / 589 » Improving Bound Propagation |
166
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
167
click to vote
IMA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adver...
164
click to vote
EVOW
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Motivated by parallel optimization, we study the SelfAdaptation algorithm for large population sizes. We first show that the current version of this algorithm does not r...
147
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
We present an efficient algorithm for testing whether a given integral polynomial has two distinct roots a, B such that fflp is a root of unity. The test is based on results obtai...
168
click to vote
WSC
2007
15 years 9 months ago
2007
We study the one-dimensional root finding problem for increasing convex functions. We give gradient-free algorithms for both exact and inexact (stochastic) function evaluations. ...