4229 search results - page 169 / 846 » On the Optimality of Spiral Search |
102
click to vote
ALMOB
2006
15 years 1 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...
108
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
112
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
118
click to vote
AIPS
2010
15 years 3 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
116
click to vote
IPPS
2006
IEEE
15 years 7 months ago
2006
IEEE
The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that simultaneously performs multi...