3510 search results - page 125 / 702 » Searching with numbers |
168
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
119
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
In numerous everyday domains, it has been demonstrated that increasing the number of options beyond a handful can lead to paralysis and poor choice and decrease satisfaction with ...
203
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
While query expansion techniques have been shown to improve retrieval performance in a centralized setting, they have not been well studied in a federated setting. In this paper, ...
176
click to vote
HICSS
2006
IEEE
16 years 17 days ago
2006
IEEE
Real-time frequent pattern mining for business intelligence systems are currently in the focal area of research. In a number of areas of doing business, especially in the arena of...
200
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...