5316 search results - page 263 / 1064 » Which Search Problems Are Random |
160
click to vote
HEURISTICS
2006
15 years 5 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 ...
127
click to vote
ML
2002
ACM
15 years 4 months ago
2002
ACM
Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while t...
181
Voted
CDB
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Long DNA sequences have to be cut using restriction enzymes into small fragments whose lengths and/or nucleotide sequences can be analyzed by currently available technolo...
121
click to vote
KCAP
2003
ACM
15 years 10 months ago
2003
ACM
In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...
144
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
—The paper studies the problem of securely storing biometric passwords, such as fingerprints and irises. With the help of coding theory Juels and Wattenberg derived in 1999 a sc...