You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Edinburgh » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Edinburgh

Return to search Previous output Next output

Output 103 of 401 in the submission

Output title

Cost-Sensitive Concurrent Planning Under Duration Uncertainty for Service-Level Agreements

Type

E - Conference contribution

DOI

Name of conference/published proceedings

Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011

Volume number

Issue number

First page of article

ISSN of proceedings

Year of publication

2011

URL

http://aaai.org/ocs/index.php/ICAPS/ICAPS11/paper/view/2667

Number of additional authors

Additional information

<22> Originality: This was the first paper to apply planning to automate the configuration of service-oriented systems using the stochastic process algebra PEPA.

Significance: Service-level agreements (SLAs) are guarantees about probability of completion of work within a time-bound (e.g. responds within 2 seconds 99% of the time). When SLAs are not met, AI planning can be used to configure the system to meet the desired SLA. The Stochastic-POPF planner developed here is capable of solving such problems effectively using anytime search and a novel temporal-and-cost-sensitive heuristic.

Rigour: The paper appeared in the top conference on automated planning and scheduling.

Interdisciplinary

Cross-referral requested

Research group

F - Laboratory for Foundations of Computer Science

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract