3055 search results - page 430 / 611 » Randomized Search Trees |
141
click to vote
IJCAI
2003
15 years 5 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
125
click to vote
AAAI
1998
15 years 5 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
149
click to vote
IJCAI
1997
15 years 5 months ago
1997
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
158
click to vote
SEBD
1997
15 years 5 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
142
click to vote
ACL
1996
15 years 5 months ago
1996
This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniqu...