scientific article; zbMATH DE number 2040688

MaRDI QIDQ4449754zbMATH OpenFDO

Authors Andrew Lim, Brian Rodrigues, Fei Xiao

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2724/27241594.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• Particle swarm optimization and hill climbing for the bandwidth minimization problem
• Reducing the bandwidth of a sparse matrix with a genetic algorithm
• Heuristics for matrix bandwidth reduction
• A hybrid technique bandwidth problem for a matrix
• Adaptive memory programming for matrix bandwidth minimization

Cited in

(4)

• Addressing the envelope reduction of sparse matrices using a genetic programming system
• The combined use of a genetic algorithm and the hill-climbing algorithm to find difference triangle sets
• Particle swarm optimization and hill climbing for the bandwidth minimization problem
• An improved simulated annealing algorithm for bandwidth minimization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449754)