5316 search results - page 240 / 1064 » Which Search Problems Are Random |
153
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
168
click to vote
TSMC
2010
14 years 11 months ago
2010
In this paper, we propose two novel techniques, which successfully address several major problems in the field of particle swarm optimization (PSO) and promise a significant breakt...
123
click to vote
ACCV
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we proposed a fast and accurate human pose estimation framework that combines top-down and bottom-up methods. The framework consists of an initialization stage and a...
132
click to vote
AAAI
1996
15 years 6 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
135
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...