4451 search results - page 299 / 891 » On Random Ordering Constraints |
166
click to vote
AAAI
2006
15 years 8 months ago
2006
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...
162
click to vote
ACL
1994
15 years 8 months ago
1994
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
203
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Many real life problems require the classification of items into naturally ordered classes. These problems are traditionally handled by conventional methods intended for the class...
177
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability tha...
281
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...