File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Extending GENET with lazy arc consistency

TitleExtending GENET with lazy arc consistency
Authors
Stuckey, PJTam, V
KeywordsArc Consistency
Constraint Satisfaction
Issue Date1998
Citation
Ieee Transactions On Systems, Man, And Cybernetics Part A:Systems And Humans., 1998, v. 28 n. 5, p. 698-703 How to Cite?
DOI: http://dx.doi.org/10.1109/3468.709620
AbstractMany important applications, such as graph coloring, scheduling and production planning, can be solved by GENET, a local search method which is used to solve binary constraint satisfaction problems (CSP's). Where complete search methods are typically augmented with consistency methods to reduce the search, local search methods are not. We propose a consistency technique, lazy arc consistency, which is suitable for use within GENET. We show it can improve the efficiency of the GENET search on some instances of binary CSP's, and does not suffer the overhead of full arc consistency. © 1998 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/155079
ISSN
1083-4427
2012 Impact Factor: 2.183
2020 SCImago Journal Rankings: 1.776
ISI Accession Number ID
WOS:000075427400014
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorStuckey, PJen_US
dc.contributor.authorTam, Ven_US
dc.date.accessioned2012-08-08T08:31:47Z-
dc.date.available2012-08-08T08:31:47Z-
dc.date.issued1998en_US
dc.identifier.citationIeee Transactions On Systems, Man, And Cybernetics Part A:Systems And Humans., 1998, v. 28 n. 5, p. 698-703en_US
dc.identifier.issn1083-4427en_US
dc.identifier.urihttp://hdl.handle.net/10722/155079-
dc.description.abstractMany important applications, such as graph coloring, scheduling and production planning, can be solved by GENET, a local search method which is used to solve binary constraint satisfaction problems (CSP's). Where complete search methods are typically augmented with consistency methods to reduce the search, local search methods are not. We propose a consistency technique, lazy arc consistency, which is suitable for use within GENET. We show it can improve the efficiency of the GENET search on some instances of binary CSP's, and does not suffer the overhead of full arc consistency. © 1998 IEEE.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.en_US
dc.subjectArc Consistencyen_US
dc.subjectConstraint Satisfactionen_US
dc.titleExtending GENET with lazy arc consistencyen_US
dc.typeArticleen_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/3468.709620en_US
dc.identifier.scopuseid_2-s2.0-0032164194en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0032164194&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume28en_US
dc.identifier.issue5en_US
dc.identifier.spage698en_US
dc.identifier.epage703en_US
dc.identifier.isiWOS:000075427400014-
dc.publisher.placeUnited Statesen_US
dc.identifier.issnl1083-4427-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats