377 search results - page 38 / 76 » A Fast Heuristic Algorithm for a Probe Mapping Problem |
135
click to vote
SIGIR
2012
ACM
13 years 4 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...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
DAGSTUHL
2007
15 years 3 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
98
Voted
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
154
Voted
TMC
2010
14 years 9 months ago
2010
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...