Sciweavers

550 search results - page 18 / 110
» Optimization and Approximation Problems Related to Polynomia...
Sort
View
ICALP
2009
Springer
14 years 3 months ago
Assigning Papers to Referees
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...
Kurt Mehlhorn
FOCS
2004
IEEE
14 years 15 days ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
DCC
2002
IEEE
14 years 8 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
TR
2008
117views more  TR 2008»
13 years 8 months ago
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
Alain Billionnet
CEC
2005
IEEE
14 years 2 months ago
A study on polynomial regression and Gaussian process global surrogate model in hierarchical surrogate-assisted evolutionary alg
This paper presents a study on Hierarchical Surrogate-Assisted Evolutionary Algorithm (HSAEA) using different global surrogate models for solving computationally expensive optimiza...
Zongzhao Zhou, Yew-Soon Ong, My Hanh Nguyen, Dudy ...