510 search results - page 22 / 102 » How Should We Solve Search Problems Privately |
CONSTRAINTS
2010
13 years 7 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
CPAIOR
2010
Springer
13 years 6 months ago
2010
Springer
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
ERCIMDL
2004
Springer
14 years 26 days ago
2004
Springer
It is argued that we are experiencing a paradigm shift from a user perspective to a client perspective in library and information science. The paradigm shift is brought about by re...
GECCO
2010
Springer
14 years 9 days ago
2010
Springer
This paper proposes an estimation of distribution algorithm (EDA) aiming at addressing globally multimodal problems, i.e., problems that present several global optima. It can be r...
JMLR
2006
13 years 7 months ago
2006
We show how the concave-convex procedure can be applied to transductive SVMs, which traditionally require solving a combinatorial search problem. This provides for the first time ...