4377 search results - page 278 / 876 » Mass problems and randomness |
159
click to vote
ICAI
2003
15 years 8 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
284
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
195
click to vote
AI
2005
Springer
16 years 7 days ago
2005
Springer
In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
181
click to vote
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...
170
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...