- Chancellery Research - Research Publications
Chancellery Research - Research Publications
Permanent URI for this collection
5 results
Filters
Reset filtersSettings
Statistics
Citations
Search Results
Now showing
1 - 5 of 5
-
ItemHow situated is your agent? a cognitive perspectiveACAY, LD ; SONENBERG, E ; Ricci, ; Pasquier, (Springer Verlag, 2009)Software agents are situated in an environment with which they interact reactively or in a goal-directed fashion. Generally, such environments do not assume a structure, hence are deemed to be unpredictable. Recent approaches adopt an environment model where artifacts form the building blocks. Artifacts represent functional components that an agent can exploit for reaching its goals. It has been argued that software agents can improve/amend their capabilities at run time through the use of (new) artifacts as possible means. We argue that such a run time adaptation by the agents can be realized by creating an appropriate relationship between agent reasoning and the functionality of the artifacts. We have coined the term extrospection to refer to the act of an agent reasoning about the tools. In this paper, we first identify the features of extrospection, then, we extend the belief, desire, intention (BDI) agent deliberation cycle to encompass extrospection.
-
ItemOn the benefits of exploiting underlying goals in argument-based negotiationRahwan, I ; Pasquier, P ; Sonenberg, L ; Dignum, F (Association for the Advancement of Artificial Intelligence, 2007-11-28)
-
ItemEntropy of the Retina TemplateArakala, A ; Culpepper, JS ; Jeffers, J ; Turpin, A ; Boztas, S ; Horadam, KJ ; McKendrick, AM ; Tistarelli, M ; Nixon, MS (SPRINGER-VERLAG BERLIN, 2009)
-
ItemA formal analysis of interest-based negotiationRahwan, I ; Pasquier, P ; Sonenberg, L ; Dignum, F (SPRINGER, 2009-04)
-
ItemA taxonomy of suffix array construction algorithmsPublisi, SJ ; Smyth, WF ; Turpin, AH (ASSOC COMPUTING MACHINERY, 2007)In 1990, Manber and Myers proposed suffix arrays as a space-saving alternative to suffix trees and described the first algorithms for suffix array construction and use. Since that time, and especially in the last few years, suffix array construction algorithms have proliferated in bewildering abundance. This survey paper attempts to provide simple high-level descriptions of these numerous algorithms that highlight both their distinctive features and their commonalities, while avoiding as much as possible the complexities of implementation details. New hybrid algorithms are also described. We provide comparisons of the algorithms' worst-case time complexity and use of additional space, together with results of recent experimental test runs on many of their implementations.