Sciweavers

664 search results - page 58 / 133
» Some results for a class of generalized polynomials
Sort
View
DAGSTUHL
2007
14 years 11 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
14 years 8 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
DAGSTUHL
2008
14 years 11 months ago
Real Algebraic Numbers: Complexity Analysis and Experimentation
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
EOR
2011
127views more  EOR 2011»
14 years 4 months ago
Methodology for determining the acceptability of system designs in uncertain environments
In practice, managers often wish to ascertain that a particular engineering design of a production system meets their requirements. The future environment of this design is likely...
Jack P. C. Kleijnen, Henri Pierreval, Jin Zhang
ALT
1999
Springer
15 years 2 months ago
PAC Learning with Nasty Noise
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz