2457 search results - page 235 / 492 » Local Search with Bootstrapping |
120
click to vote
AIPS
2006
15 years 6 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
143
click to vote
JCO
2007
15 years 5 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
143
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
— This work investigates the effects of the periodization of local and global multi-objective search algorithms. To this, we introduce a model for periodization and define a new...
132
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
To find the best lattice model representation of a given full atom protein structure is a hard computational problem. Several greedy methods have been suggested where results are ...
166
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...