Sciweavers

17770 search results - page 157 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
COLOGNETWENTE
2009
14 years 11 months ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...
TALG
2008
81views more  TALG 2008»
14 years 10 months ago
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin F...
TCS
2008
14 years 10 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
14 years 10 months ago
Bijections and Congruences for Generalizations of Partition Identities of Euler and Guy
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...
James A. Sellers, Andrew V. Sills, Gary L. Mullen
SAC
2008
ACM
14 years 9 months ago
Adaptive importance sampling in general mixture classes
In this paper, we propose an adaptive algorithm that iteratively updates both the weights and component parameters of a mixture importance sampling density so as to optimise the p...
Olivier Cappé, Randal Douc, Arnaud Guillin,...