2899 search results - page 231 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
186
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
162
click to vote
ECIS
2003
15 years 8 months ago
2003
Multiple combinations of hardware and network components can be selected to design an information technology (IT) infrastructure that satisfies performance requirements. The profe...
180
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
187
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Consider a communications system where the detector generates a mix of hard and soft outputs, which are then fed into a soft-input channel decoder. In such a setting, it...
197
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...