5316 search results - page 22 / 1064 » Which Search Problems Are Random |
122
Voted
ETFA
2008
IEEE
15 years 4 months ago
2008
IEEE
In factory automation, production line scheduling entails a number of competing issues. Finding optimal configurations often requires use of local search techniques. Local search l...
99
Voted
GCB
1997
Springer
15 years 6 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
107
Voted
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
139
Voted
CEC
2009
IEEE
15 years 14 days ago
2009
IEEE
This paper studies the difference between Persistent Random Constants (PRC) and Digit Concatenation as methods for generating constants. It has been shown that certain problems hav...
109
click to vote
CPAIOR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...