1576 search results - page 150 / 316 » Properties of Synthetic Optimization Problems |
159
click to vote
LION
2007
Springer
15 years 10 months ago
2007
Springer
This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered i...
186
click to vote
CODES
2003
IEEE
15 years 9 months ago
2003
IEEE
One of the most challenging problems in high-level synthesis is how to quickly explore a wide range of design options to achieve high-quality designs. This paper presents an Integ...
135
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
135
click to vote
JPDC
2007
15 years 4 months ago
2007
This paper discusses algorithmic and implementation aspects of a distributed remote visualization system that optimally decomposes and adaptively maps the visualization pipeline t...
145
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...