An Extension Matrix Approach To The General Covering Problem

Jiarong Hong; Ryszard Michalski; Carl Uhrik

doi:10.1117/12.964180

26 March 1986 An Extension Matrix Approach To The General Covering Problem

Jiarong Hong, Ryszard Michalski, Carl Uhrik

Proceedings Volume 0635, Applications of Artificial Intelligence III; (1986) https://doi.org/10.1117/12.964180
Event: 1986 Technical Symposium Southeast, 1986, Orlando, United States

Abstract

A new approach, called the extension matrix (EM) approach, for describing and solving the general covering problem (GCP) is proposed. The paper emphasizes that the GCP is NP-hard and describes an approximately optimal covering algorithm, AE1. AE1 incorporates the EM approach with a variety of heuristic search strategies. Results show the new algorithm to be efficient and useful for large scale problems.

Citation Download Citation

Jiarong Hong, Ryszard Michalski, and Carl Uhrik "An Extension Matrix Approach To The General Covering Problem", Proc. SPIE 0635, Applications of Artificial Intelligence III, (26 March 1986); https://doi.org/10.1117/12.964180

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available