294 search results - page 39 / 59 » A hybrid metaheuristic approach to solving the UBQP problem |
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— A number of advanced sampling strategies have been proposed in recent years to address the narrow passage problem for probabilistic roadmap (PRM) planning. These sampling strat...
AIPS
2011
12 years 11 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
CP
2004
Springer
14 years 1 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
CLEIEJ
2010
13 years 5 months ago
2010
The haptic rendering of surface mesostructure (fine relief features) in dense triangle meshes requires special structures, equipment, and high sampling rates for detailed perceptio...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
This paper shows that a novel hybrid algorithm, Breeding Swarms, performs equal to, or better than, Genetic Algorithms and Particle Swarm Optimizers when training recurrent neural...