5316 search results - page 252 / 1064 » Which Search Problems Are Random |
132
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
128
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Various local search approaches have recently been applied to machine scheduling problems under multiple objectives. Their foremost consideration is the identification of the set ...
129
click to vote
JAR
2000
15 years 4 months ago
2000
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
124
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: We consider effects of dependence among variables of high-dimensional data in multiple hypothesis testing problems, in particular the False Discovery Rate (FDR) contro...
133
click to vote
EOR
2006
15 years 4 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...