16082 search results - page 532 / 3217 » Fireworks Algorithm for Optimization |
190
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
With a large variety of wireless access technologies available, multi-homed devices may strongly improve the performance and reliability of communication when using multiple networ...
180
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
210
click to vote
SIGIR
2012
ACM
13 years 9 months ago
2012
ACM
In this paper, we tackle the problem of top-N context-aware recommendation for implicit feedback scenarios. We frame this challenge as a ranking problem in collaborative filterin...
182
click to vote
ESA
1999
Springer
15 years 11 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
152
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...