230 search results - page 16 / 46 » Quantum Search with Variable Times |
99
Voted
ASPDAC
2005
ACM
15 years 2 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
100
Voted
CORR
2000
Springer
15 years 6 days ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
126
Voted
SAT
2010
Springer
14 years 10 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
JSAT
2008
15 years 10 days ago
2008
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
ICRA
2008
IEEE
15 years 6 months ago
2008
IEEE
— Consider the task of searching a region for the presence or absence of a target using a team of multiple searchers. This paper formulates this search problem as a sequential pr...