Verification of Attributes in Linked Lists Using Ant Colony Metaphor

Verification of Attributes in Linked Lists Using Ant Colony Metaphor

Soumya Banerjee, P. K. Mahanti
ISBN13: 9781615208098|ISBN10: 1615208097|ISBN13 Softcover: 9781616923211|EISBN13: 9781615208104
DOI: 10.4018/978-1-61520-809-8.ch012
Cite Chapter Cite Chapter

MLA

Banerjee, Soumya, and P. K. Mahanti. "Verification of Attributes in Linked Lists Using Ant Colony Metaphor." Evolutionary Computation and Optimization Algorithms in Software Engineering: Applications and Techniques, edited by Monica Chis, IGI Global, 2010, pp. 220-228. https://doi.org/10.4018/978-1-61520-809-8.ch012

APA

Banerjee, S. & Mahanti, P. K. (2010). Verification of Attributes in Linked Lists Using Ant Colony Metaphor. In M. Chis (Ed.), Evolutionary Computation and Optimization Algorithms in Software Engineering: Applications and Techniques (pp. 220-228). IGI Global. https://doi.org/10.4018/978-1-61520-809-8.ch012

Chicago

Banerjee, Soumya, and P. K. Mahanti. "Verification of Attributes in Linked Lists Using Ant Colony Metaphor." In Evolutionary Computation and Optimization Algorithms in Software Engineering: Applications and Techniques, edited by Monica Chis, 220-228. Hershey, PA: IGI Global, 2010. https://doi.org/10.4018/978-1-61520-809-8.ch012

Export Reference

Mendeley
Favorite

Abstract

The chapter describes the validation of the attributes of linked list using modified pheromone biased model (of Ant colony) under complex application environment mainly for kernel configuration and device driver operations. The proposed approach incorporates the idea of pheromone exploration strategy with small learning parameter associated while traversing a linked list. This process of local propagation on loop and learning on traversal is not available with the conventional validation mechanism of data structure using predicate logic. It has also been observed from simulation that the proposed ant colony algorithm with different pheromone value produces better convergence on linked list.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.