3862 search results - page 446 / 773 » Adaptive Noisy Optimization |
143
click to vote
COCO
2004
Springer
16 years 4 days ago
2004
Springer
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
155
click to vote
GECCO
2004
Springer
16 years 4 days ago
2004
Springer
In this paper, we compare the performance of hierarchical GP methods (Automatically Defined Functions, Module Acquisition, Adaptive Representation through Learning) with the canon...
180
click to vote
AAECC
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
122
click to vote
TIT
2008
15 years 6 months ago
2008
In this paper, we analyze optimal (in space and time) adaptive power transmission policies for fading channels when the channel-state information (CSI) at the transmitter (CSIT) an...
210
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...