Sciweavers

1647 search results - page 251 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
13 years 12 days ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
TIT
2002
102views more  TIT 2002»
13 years 8 months ago
Asymptotic efficiency of two-stage disjunctive testing
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
Toby Berger, Vladimir I. Levenshtein
ANOR
2006
133views more  ANOR 2006»
13 years 9 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...
COLT
2008
Springer
13 years 10 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 9 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos