Sciweavers

1578 search results - page 144 / 316
» Algorithmic randomness of continuous functions
Sort
View
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
14 years 1 months ago
The dispersion metric and the CMA evolution strategy
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
Monte Lunacek, Darrell Whitley
MP
2006
105views more  MP 2006»
13 years 10 months ago
Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach
We consider two-stage pure integer programs with discretely distributed stochastic right-hand sides. We present an equivalent superadditive dual formulation that uses the value fun...
Nan Kong, Andrew J. Schaefer, Brady Hunsaker
SODA
2003
ACM
107views Algorithms» more  SODA 2003»
13 years 11 months ago
Fault-tolerant facility location
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
Chaitanya Swamy, David B. Shmoys
PAMI
2007
176views more  PAMI 2007»
13 years 9 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
EUROPAR
2006
Springer
14 years 1 months ago
Multicost Routing over an Infinite Time Horizon in Energy and Capacity Constrained Wireless Ad-Hoc Networks
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...