Sciweavers

4451 search results - page 75 / 891
» On Random Ordering Constraints
Sort
View
MMAS
2010
Springer
14 years 6 months ago
Homogenization with Large Spatial Random Potential
We consider the homogenization of parabolic equations with large spatiallydependent potentials modeled as Gaussian random fields. We derive the homogenized equations in the limit ...
Guillaume Bal
DAC
2009
ACM
15 years 6 months ago
Yield-driven iterative robust circuit optimization algorithm
This paper proposes an equation-based multi-scenario iterative robust optimization methodology for analog/mixed-signal circuits. We show that due to local circuit performance mono...
Yan Li, Vladimir Stojanovic
SIAMJO
2008
57views more  SIAMJO 2008»
14 years 11 months ago
Universal Confidence Sets for Solutions of Optimization Problems
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
Silvia Vogel
CP
2004
Springer
15 years 5 months ago
A Domain Consistency Algorithm for the Stretch Constraint
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consist...
Lars Hellsten, Gilles Pesant, Peter van Beek
COMPGEOM
2003
ACM
15 years 5 months ago
Incremental constructions con BRIO
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...
Nina Amenta, Sunghee Choi, Günter Rote