Sciweavers

1506 search results - page 104 / 302
» On the Distribution of Natural Probability Functions
Sort
View
PPSN
2010
Springer
15 years 2 months ago
General Lower Bounds for the Running Time of Evolutionary Algorithms
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
Dirk Sudholt
IEEEARES
2009
IEEE
15 years 2 months ago
Quantitative Analysis of Secure Information Flow via Probabilistic Semantics
We present an automatic analyzer for measuring information flow within software systems. In this paper, we quantify leakage in terms of information theory and incorporate this comp...
Chunyan Mu, David Clark
JSAC
2006
180views more  JSAC 2006»
15 years 4 months ago
A Tutorial on Decomposition Methods for Network Utility Maximization
A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the...
Daniel Pérez Palomar, Mung Chiang
ICRA
1999
IEEE
110views Robotics» more  ICRA 1999»
15 years 8 months ago
Subpixel Localization and Uncertainty Estimation Using Occupancy Grids
We describe techniques for performing mobile robot localization using occupancy grids that allow subpixel localization and uncertainty estimation in the pixelized pose space. The ...
Clark F. Olson
ESANN
2000
15 years 5 months ago
A neural network approach to adaptive pattern analysis - the deformable feature map
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
Axel Wismüller, Frank Vietze, Dominik R. Ders...