1833 search results - page 192 / 367 » A Matrix-Based Approach to the Global Locality Optimization ... |
145
Voted
HEURISTICS
2006
15 years 4 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
189
click to vote
CRYPTO
2003
Springer
15 years 9 months ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
114
click to vote
WABI
2004
Springer
15 years 9 months ago
2004
Springer
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
128
Voted
EMO
2009
Springer
15 years 10 months ago
2009
Springer
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
104
click to vote
AAAI
2008
15 years 6 months ago
2008
Machine learning approaches to indoor WiFi localization involve an offline phase and an online phase. In the offline phase, data are collected from an environment to build a local...