244 search results - page 11 / 49 » On-Line Probability, Complexity and Randomness |
106
click to vote
WSC
2001
15 years 3 months ago
2001
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
255
Voted
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
TSP
2010
14 years 8 months ago
2010
The generalized Gaussian distribution (GGD) provides a flexible and suitable tool for data modeling and simulation, however the characterization of the complex-valued GGD, in parti...
112
Voted
NC
2007
15 years 1 months ago
2007
Abstract. We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an inï¬...
100
Voted
COCO
2005
Springer
15 years 7 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...