Sciweavers

7228 search results - page 410 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ANOR
2004
122views more  ANOR 2004»
15 years 6 months ago
Call Center Staffing with Simulation and Cutting Plane Methods
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
Júlíus Atlason, Marina A. Epelman, S...
SIAMSC
2010
141views more  SIAMSC 2010»
15 years 5 months ago
Blendenpik: Supercharging LAPACK's Least-Squares Solver
Abstract. Several innovative random-sampling and random-mixing techniques for solving problems in linear algebra have been proposed in the last decade, but they have not yet made a...
Haim Avron, Petar Maymounkov, Sivan Toledo
IMC
2010
ACM
15 years 4 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
TSP
2011
151views more  TSP 2011»
15 years 1 months ago
Stochastic Models for Sparse and Piecewise-Smooth Signals
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...
Michael Unser, Pouya Dehghani Tafti
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 27 days ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile