Sciweavers

414 search results - page 57 / 83
» On discrete norms of polynomials
Sort
View
COMPGEOM
2004
ACM
14 years 3 months ago
Computing persistent homology
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...
Afra Zomorodian, Gunnar Carlsson
PODC
2004
ACM
14 years 3 months ago
Compact routing on euclidian metrics
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
Ittai Abraham, Dahlia Malkhi
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 3 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
GECCO
2004
Springer
100views Optimization» more  GECCO 2004»
14 years 3 months ago
Analysis of the (1+1) EA for a Noisy OneMax
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...
Stefan Droste
HYBRID
2004
Springer
14 years 3 months ago
Constructing Invariants for Hybrid Systems
Abstract. An invariant of a system is a predicate that holds for every reachable state. In this paper, we present techniques to generate invariants for hybrid systems. This is achi...
Sriram Sankaranarayanan, Henny Sipma, Zohar Manna