Sciweavers

3838 search results - page 257 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
IEEEPACT
2008
IEEE
15 years 11 months ago
Feature selection and policy optimization for distributed instruction placement using reinforcement learning
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...
Katherine E. Coons, Behnam Robatmili, Matthew E. T...
FOCS
2004
IEEE
15 years 8 months 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
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
15 years 10 months ago
Adaptive Sampling for Noisy Problems
Abstract. The usual approach to deal with noise present in many realworld optimization problems is to take an arbitrary number of samples of the objective function and use the samp...
Erick Cantú-Paz
SIGMOD
2001
ACM
120views Database» more  SIGMOD 2001»
16 years 5 months ago
Materialized View Selection and Maintenance Using Multi-Query Optimization
Materialized views have been found to be very effective at speeding up queries, and are increasingly being supported by commercial databases and data warehouse systems. However, w...
Hoshi Mistry, Prasan Roy, S. Sudarshan, Krithi Ram...
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 11 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri