1603 search results - page 79 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
122
click to vote
CPAIOR
2004
Springer
15 years 11 months ago
2004
Springer
We discuss a di cult optimization problem on a chess-board, requiring equal numbers of black and white queens to be placed on the board so that the white queens cannot attack the b...
168
click to vote
FLAIRS
2008
15 years 8 months ago
2008
In machine learning, decision trees are employed extensively in solving classification problems. In order to design a decision tree classifier two main phases are employed. The fi...
178
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
171
click to vote
JCO
2010
15 years 4 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
171
click to vote
ANOR
2011
14 years 10 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...