697 search results - page 45 / 140 » On the Theory of Average Case Complexity |
DISOPT
2011
12 years 11 months ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
RECSYS
2009
ACM
14 years 2 months ago
2009
ACM
Previous work on using external aggregate rating information showed that this information can be incorporated in several different types of recommender systems and improves their...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
LPNMR
1995
Springer
13 years 11 months ago
1995
Springer
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...