1930 search results - page 193 / 386 » Learning to Solve QBF |
KDD
2009
ACM
14 years 10 months ago
2009
ACM
Nowadays, enormous amounts of data are continuously generated not only in massive scale, but also from different, sometimes conflicting, views. Therefore, it is important to conso...
KDD
2008
ACM
14 years 10 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
KDD
2006
ACM
14 years 10 months ago
2006
ACM
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
HICSS
2006
IEEE
14 years 3 months ago
2006
IEEE
The classical (ad hoc) document retrieval problem has been traditionally approached through ranking according to heuristically developed functions (such as tf.idf or bm25) or gene...