1341 search results - page 71 / 269 » Automatic Algorithm Configuration Based on Local Search |
ALMOB
2006
14 years 10 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
AUSAI
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
IJDAR
2008
14 years 10 months ago
2008
As large quantity of document images is getting archived by the digital libraries, there is a need for an efficient search strategies to make them available as per users informatio...
IROS
2007
IEEE
15 years 4 months ago
2007
IEEE
— A new solution to the Simultaneous Localization and Modelling problem is presented. It is based on the stochastic search of solutions in the state space to the global localizat...