721 search results - page 80 / 145 » On Generators of Random Quasigroup Problems |
154
click to vote
SIGIR
2008
ACM
15 years 3 months ago
2008
ACM
This paper addresses the issue of query refinement, which involves reformulating ill-formed search queries in order to enhance relevance of search results. Query refinement typica...
145
click to vote
TIME
2002
IEEE
15 years 8 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
130
Voted
SPIRE
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
123
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...
133
click to vote
GLVLSI
2007
IEEE
15 years 10 months ago
2007
IEEE
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...