415 search results - page 38 / 83 » An efficient approximation for the Generalized Assignment Pr... |
147
click to vote
CONSTRAINTS
2010
15 years 2 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
115
Voted
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
We describe an efficient technique to weigh word-based features in binary classification tasks and show that it significantly improves classification accuracy on a range of proble...
125
click to vote
AIPS
2008
15 years 4 months ago
2008
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
172
click to vote
CPM
1998
Springer
15 years 6 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
192
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...