4377 search results - page 50 / 876 » Mass problems and randomness |
SODA
1998
ACM
14 years 11 months ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
ALGORITHMICA
2002
14 years 9 months ago
2002
We consider a special case of the weighted caching problem where
APPML
2007
14 years 10 months ago
2007
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...