Learn More
SHOP and SHOP2 are HTN planning systems that were designed with two goals in mind: to investigate some research issues in automated planning, and to provide some simple, practical planning tools. They are available as freeware, and have developed an active base of users in government laboratories, industrial R&D projects, and academic settings. This paper(More)
We present SADSR (Security-Aware Adaptive DSR), a secure routing protocol for mobile ad hoc networks. SADSR authenticates the routing protocol messages using digital signatures based on asymmetric cryptography. The basic idea behind SADSR is to have multiple routes to each destination and store a local trust value for each node in the network. A trust value(More)
This paper describes SiN, a novel case-based planning algorithm that combines conversational case retrieval with generative planning. SiN is provably correct, and can generate plans given an incomplete domain theory by using cases to extend that domain theory. SiN can also reason with imperfect world-state information by incorporing preferences into the(More)
One of the assumptions in classical planning is that the environment is static: i.e., the planner is the only entity that can induce changes in the environment. A more realistic assumption is that the environment is dynamic; that is, there are other entities in the world and the actions generated by the planner may fail due to the operations of these(More)
Previous algorithms for learning lexicographic preference models (LPMs) produce a "best guess" LPM that is consistent with the observations. Our approach is more democratic: we do not commit to a single LPM. Instead, we approximate the target using the votes of a <i>collection</i> of consistent LPMs. We present two variations of this method---<i>variable(More)
We present a workflow for the design and production of biological networks from high-level program specifications. The workflow is based on a sequence of intermediate models that incrementally translate high-level specifications into DNA samples that implement them. We identify algorithms for translating between adjacent models and implement them as a set(More)