1613 search results - page 36 / 323 » Efficient and Effective Practical Algorithms for the Set-Cov... |
SIGMOD
2009
ACM
14 years 7 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...
IJCAI
1997
13 years 8 months ago
1997
Many of the challenges faced by the £eld of Computational Intelligence in building intelligent agents, involve determining mappings between numerous and varied sensor inputs and ...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
: - In this paper we address two problems, for which we present novel, efficient, algorithmic solutions. The first problem is motivated by practical situations and is concerned wit...
SIGSOFT
2010
ACM
13 years 5 months ago
2010
ACM
Concurrent programs are notoriously difficult to debug. We see two main reasons for this: 1) concurrency bugs are often difficult to reproduce, 2) traces of buggy concurrent execu...