dc.contributor.author |
Lesaint, David |
|
dc.contributor.author |
Mehta, Deepak |
|
dc.contributor.author |
O'Sullivan, Barry |
|
dc.contributor.author |
Quesada, Luis |
|
dc.contributor.author |
Wilson, Nic |
|
dc.date.accessioned |
2013-04-30T16:58:53Z |
|
dc.date.available |
2013-04-30T16:58:53Z |
|
dc.date.copyright |
2010 |
|
dc.date.issued |
2010-06 |
|
dc.identifier.citation |
David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, and Nic Wilson (2010) 'Developing Approaches for Solving a Telecommunications Feature Subscription Problem'. Journal of Artificial Intelligence Research, 38 :271-305. doi: 10.1613/jair.2992 |
en |
dc.identifier.volume |
38 |
en |
dc.identifier.startpage |
271 |
en |
dc.identifier.endpage |
305 |
en |
dc.identifier.issn |
10769757 |
|
dc.identifier.uri |
http://hdl.handle.net/10468/1106 |
|
dc.identifier.doi |
10.1613/jair.2992 |
|
dc.description.abstract |
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to find an optimal relaxation, which is a generalisation of the feedback vertex set problem on directed graphs, and thus it is an NP-hard task. We present several constraint programming formulations of the problem. We also present formulations using partial weighted maximum Boolean satisfiability and mixed integer linear programming. We study all these formulations by experimentally comparing them on a variety of randomly generated instances of the feature subscription problem. |
en |
dc.format.mimetype |
application/pdf |
en |
dc.language.iso |
en |
en |
dc.publisher |
AI Access Foundation |
en |
dc.relation.uri |
http://jair.org/papers/paper2992.html |
|
dc.rights |
© 2010 AI Access Foundation. |
en |
dc.subject |
Configuration |
en |
dc.subject |
Subscription |
en |
dc.subject |
Feedback vertex set problem |
en |
dc.subject |
NP-hard task |
en |
dc.subject |
Constraint programming |
en |
dc.subject |
Boolean |
en |
dc.subject |
Mixed integer linear programming |
en |
dc.subject.lcsh |
Computer science. |
en |
dc.title |
Developing approaches for solving a telecommunications feature subscription problem |
en |
dc.type |
Article (peer-reviewed) |
en |
dc.internal.authorurl |
http://research.ucc.ie/profiles/D005/nwilson |
en |
dc.internal.authorcontactother |
Nic Wilson, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: n.wilson@4c.ucc.ie |
en |
dc.internal.availability |
Full text available |
en |
dc.date.updated |
2012-12-20T17:33:59Z |
|
dc.description.version |
Published Version |
en |
dc.internal.rssid |
43334107 |
|
dc.internal.rssid |
54410715 |
|
dc.internal.wokid |
000280365600001 |
|
dc.contributor.funder |
Science Foundation Ireland
|
en |
dc.description.status |
Peer reviewed |
en |
dc.identifier.journaltitle |
Journal of Artificial Intelligence Research |
en |
dc.internal.copyrightchecked |
No. CORA - Non-commercial scholarly repositories may archive electronic copies of JAIR articles, provided that appropriate reference is made to JAIR as the original publisher. |
en |
dc.internal.licenseacceptance |
Yes |
en |
dc.internal.IRISemailaddress |
n.wilson@ucc.ie |
en |
dc.internal.IRISemailaddress |
l.quesada@ucc.ie |
en |
dc.internal.IRISemailaddress |
l.quesada@4c.ucc.ie |
en |
dc.relation.project |
info:eu-repo/grantAgreement/SFI/SFI Technology and Innovation Development Award (TIDA)/05/IN.1/I886 TIDA 09/IE/Costraint Baset Energy Cost Efficient Scheduling/
|
|
dc.relation.project |
info:eu-repo/grantAgreement/SFI/SFI Principal Investigator Programme (PI)/08/IN.1/I1912/IE/The Development of Artificial intelligence Approaches for Preferences in Combinational Problems/
|
|