10792 search results - page 353 / 2159 » An Evaluation of Non-Equijoin Algorithms |
182
Voted
SIGECOM
2000
ACM
15 years 11 months ago
2000
ACM
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
160
click to vote
SIGIR
1998
ACM
15 years 11 months ago
1998
ACM
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity...
148
click to vote
CP
1997
Springer
15 years 11 months ago
1997
Springer
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
200
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
156
Voted
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
The results of the last MaxSAT Evaluations suggest there is no universal best algorithm for solving MaxSAT, as the fastest solver often depends on the type of instance. Having an ...