727 search results - page 39 / 146 » Private approximation of search problems |
WINE
2009
Springer
14 years 4 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
HICSS
1999
IEEE
14 years 2 months ago
1999
IEEE
As access to hypermedia documents becomes generally available, it becomes increasingly important to understand how casual users search for information. We have studied search patt...
APPROX
2008
Springer
14 years 3 days ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
AUSAI
2009
Springer
14 years 1 months ago
2009
Springer
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...
CEC
2010
IEEE
13 years 11 months ago
2010
IEEE
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...