727 search results - page 8 / 146 » Private approximation of search problems |
114
Voted
HEURISTICS
1998
14 years 11 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
102
Voted
CRYPTO
2005
Springer
15 years 5 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
106
Voted
TAMC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...