1046 search results - page 139 / 210 » Approximation Algorithms for Domination Search |
116
click to vote
LICS
2002
IEEE
15 years 8 months ago
2002
IEEE
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
112
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
152
click to vote
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
106
click to vote
RECSYS
2009
ACM
15 years 9 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
120
click to vote
HPDC
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is...