5316 search results - page 145 / 1064 » Which Search Problems Are Random |
123
click to vote
IGPL
2006
15 years 3 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
117
Voted
ICIAR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Random Amplified Polymorphism DNA (RAPD) analysis is a wellknown method for studying genetic relationships between individuals. In this context, processing the underlying...
129
Voted
CC
2008
Springer
15 years 3 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
126
Voted
RSA
2006
15 years 3 months ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
124
click to vote
ICST
2010
IEEE
15 years 2 months ago
2010
IEEE
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...