Sciweavers

3818 search results - page 226 / 764
» Word Problems on Compressed Words
Sort
View
ANOR
2010
89views more  ANOR 2010»
15 years 6 months ago
Convex approximations for a class of mixed-integer recourse models
We consider mixed-integer recourse (MIR) models with a single recourse constraint. We relate the second-stage value function of such problems to the expected simple integer recour...
Maarten H. van der Vlerk
AUTOMATICA
2010
218views more  AUTOMATICA 2010»
15 years 6 months ago
Gossip consensus algorithms via quantized communication
This paper considers the average consensus problem on a network of digital links, and proposes algorithms based on pairwise "gossip" communications and updates. Through ...
Ruggero Carli, Fabio Fagnani, Paolo Frasca, Sandro...
EOR
2008
90views more  EOR 2008»
15 years 6 months ago
An improved simulated annealing algorithm for bandwidth minimization
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
CORR
2006
Springer
88views Education» more  CORR 2006»
15 years 6 months ago
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
Wim Martens, Frank Neven, Marc Gyssens
FS
2006
102views more  FS 2006»
15 years 6 months ago
Bounds for Functions of Dependent Risks
Abstract The problem of finding the best-possible lower bound on the distribution of a non-decreasing function of n dependent risks is solved when n = 2 and a lower bound on the co...
Paul Embrechts, Giovanni Puccetti