5316 search results - page 215 / 1064 » Which Search Problems Are Random |
157
click to vote
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
— Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global o...
135
Voted
AMC
2006
15 years 4 months ago
2006
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
143
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Conditional random fields(CRFs) are a class of undirected graphical models which have been widely used for classifying and labeling sequence data. The training of CRFs is typicall...
169
click to vote
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
161
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...