Sciweavers

3818 search results - page 290 / 764
» Word Problems on Compressed Words
Sort
View
ORL
2007
49views more  ORL 2007»
15 years 6 months ago
Lot sizing with inventory gains
This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one ...
Hamish Waterer
SIAMJO
2008
99views more  SIAMJO 2008»
15 years 6 months ago
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
Marco C. Campi, Simone Garatti
CONCUR
2004
Springer
16 years 1 days ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz
SIAMJO
2008
72views more  SIAMJO 2008»
15 years 6 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed
SIAMJO
2008
74views more  SIAMJO 2008»
15 years 6 months ago
Lagrangian-Dual Functions and Moreau--Yosida Regularization
In this paper, we consider the Lagrangian dual problem of a class of convex optimization problems. We first discuss the semismoothness of the Lagrangian-dual function . This prope...
Fanwen Meng, Gongyun Zhao, Mark Goh, Robert de Sou...