<?xml version="1.0"?>

<!DOCTYPE owl [
	<!ENTITY rdf "http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<!ENTITY rdfs "http://www.w3.org/2000/01/rdf-schema#">
	<!ENTITY xsd "http://www.w3.org/2001/XMLSchema#">
	<!ENTITY owl "http://www.w3.org/2002/07/owl#">
	<!ENTITY cc "http://web.resource.org/cc/#">
	<!ENTITY project "http://ebiquity.umbc.edu/ontology/project.owl#">
	<!ENTITY person "http://ebiquity.umbc.edu/ontology/person.owl#">
	<!ENTITY pub "http://ebiquity.umbc.edu/ontology/publication.owl#">
	<!ENTITY assert "http://ebiquity.umbc.edu/ontology/assertion.owl#">
]>

<!--

This ontology document is licensed under the Creative Commons
Attribution License. To view a copy of this license, visit
http://creativecommons.org/licenses/by/2.0/ or send a letter to
Creative Commons, 559 Nathan Abbott Way, Stanford, California
94305, USA.

-->

<rdf:RDF 
		xmlns:rdf = "&rdf;"
		xmlns:rdfs = "&rdfs;"
		xmlns:xsd = "&xsd;"
		xmlns:owl = "&owl;"
		xmlns:cc = "&cc;"
		xmlns:project = "&project;"
		xmlns:person = "&person;"
		xmlns:pub = "&pub;"
		xmlns:assert = "&assert;">
	<pub:InProceedings rdf:about="http://ebiquity.umbc.edu/paper/html/id/402/Improving-a-Plan-Library-for-Real-time-Systems-Using-Nearly-Orthogonal-Latin-Hypercube-Sampling">
		<rdfs:label><![CDATA[Improving a Plan Library for Real-time Systems Using Nearly Orthogonal Latin Hypercube Sampling]]></rdfs:label>
		<pub:title><![CDATA[Improving a Plan Library for Real-time Systems Using Nearly Orthogonal Latin Hypercube Sampling]]></pub:title>
		<pub:publishedOn rdf:datatype="&xsd;dateTime">2008-07-13T00:00:00-05:00</pub:publishedOn>
		<pub:abstract><![CDATA[Computing solutions to intractable planning problems is particularly problematic within real-time domains. One approach to this challenge includes off-line computation, such as precomputing a plan library. However, because complex domains preclude creating a comprehensive library, a system must choose a subset of all possible plans to include in the library. Strategic selections will reduce the probability that a system encounters a situation for which it does not have an appropriate plan in the library to either apply directly or adapt. Choosing variable values using Latin hypercubes is a technique used to reduce the number of test cases required in order to validate complex systems. Here we discuss the application of a variation of this technique, nearly orthogonal Latin hypercubes, to planning spaces in order reduce the number of plans a system must cache in its library.]]></pub:abstract>
		<pub:pages><![CDATA[1804-1805]]></pub:pages>
		<pub:note><![CDATA[(Student abstract)]]></pub:note>
		<pub:counter>4139</pub:counter>
		<pub:booktitle><![CDATA[Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence]]></pub:booktitle>
		<pub:publisher><![CDATA[AAAI Press]]></pub:publisher>
		<pub:author>
			<rdf:List>
				<rdf:first>
					<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Robert/Holder"><person:name><![CDATA[Robert Holder]]></person:name><rdfs:label><![CDATA[Robert Holder]]></rdfs:label></person:Person>
				</rdf:first>
				<rdf:rest rdf:resource="&rdf;nil" />
			</rdf:List>
		</pub:author>
		<pub:firstAuthor>
<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Robert/Holder"><person:name><![CDATA[Robert Holder]]></person:name><rdfs:label><![CDATA[Robert Holder]]></rdfs:label></person:Person>
		</pub:firstAuthor>
		<pub:softCopy><pub:SoftCopy>
			<pub:softCopyFormat><![CDATA[PDF Document]]></pub:softCopyFormat>
			<pub:softCopyURI><![CDATA[http://ebiquity.umbc.edu/get/a/publication/426.pdf]]></pub:softCopyURI>
			<pub:softCopySize>165181</pub:softCopySize>
			</pub:SoftCopy>
			</pub:softCopy>
		<pub:softCopy><pub:SoftCopy>
			<pub:softCopyFormat><![CDATA[Microsoft PowerPoint]]></pub:softCopyFormat>
			<pub:softCopyURI><![CDATA[http://ebiquity.umbc.edu/get/a/publication/427.ppt]]></pub:softCopyURI>
			<pub:softCopySize>180224</pub:softCopySize>
			</pub:SoftCopy>
			</pub:softCopy>
	</pub:InProceedings>

<rdf:Description rdf:about="">
	<cc:License rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
</rdf:Description>

</rdf:RDF>
