Sciweavers

1763 search results - page 171 / 353
» Dependent random choice
Sort
View
ANOR
2006
133views more  ANOR 2006»
13 years 8 months ago
An integrated model for logistics network design
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. Our formulation is flexi...
Jean-François Cordeau, Federico Pasin, Mari...
JCC
2008
166views more  JCC 2008»
13 years 8 months ago
Reference energy extremal optimization: A stochastic search algorithm applied to computational protein design
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
Naigong Zhang, Chen Zeng
ML
2008
ACM
13 years 8 months ago
Discovering significant patterns
Pattern discovery techniques, such as association rule discovery, explore large search spaces of potential patterns to find those that satisfy some user-specified constraints. Due...
Geoffrey I. Webb
MOR
2006
80views more  MOR 2006»
13 years 8 months ago
Regret Minimization Under Partial Monitoring
We consider repeated games in which the player, instead of observing the action chosen by the opponent in each game round, receives a feedback generated by the combined choice of ...
Nicolò Cesa-Bianchi, Gábor Lugosi, G...
SIAMDM
2008
105views more  SIAMDM 2008»
13 years 8 months ago
Average Spectra and Minimum Distances of Low-Density Parity-Check Codes over Abelian Groups
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...
Giacomo Como, Fabio Fagnani