Sciweavers

56 search results - page 2 / 12
» A HOL Theory of Euclidean Space
Sort
View
COCOON
2008
Springer
13 years 6 months ago
Dimensions of Points in Self-similar Fractals
We use nontrivial connections between the theory of computing and the finescale geometry of Euclidean space to give a complete analysis of the dimensions of individual points in f...
Jack H. Lutz, Elvira Mayordomo
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
13 years 11 months ago
Geometric particle swarm optimisation on binary and real spaces: from theory to practice
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Cecilia Di Chio, Alberto Moraglio, Riccardo Poli
STOC
1989
ACM
99views Algorithms» more  STOC 1989»
13 years 8 months ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Martin E. Dyer, Alan M. Frieze, Ravi Kannan
JAR
2008
88views more  JAR 2008»
13 years 4 months ago
Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables
Statistical quantities, such as expectation (mean) and variance, play a vital role in the present age probabilistic analysis. In this paper, we present some formalization of expect...
Osman Hasan, Sofiène Tahar
SIGMETRICS
2006
ACM
114views Hardware» more  SIGMETRICS 2006»
13 years 10 months ago
On suitability of Euclidean embedding of internet hosts
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...
Sanghwan Lee, Zhi-Li Zhang, Sambit Sahu, Debanjan ...