510 search results - page 16 / 102 » How Should We Solve Search Problems Privately |
AUSAI
2004
Springer
14 years 26 days ago
2004
Springer
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
SIGMOD
2010
ACM
13 years 5 months ago
2010
ACM
More and more important data is accumulated inside social networks. Limiting the flow of private information across a social network is very important, and most social networks pr...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
In multi-agent systems where sets of joint actions (JAs) are generated, metrics are needed to evaluate these sets and efficiently allocate resources for the many JAs. For the case...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
CSCLP
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...