Sciweavers

1912 search results - page 226 / 383
» GOAL as a Planning Formalism
Sort
View
SFM
2011
Springer
253views Formal Methods» more  SFM 2011»
14 years 9 months ago
Application-Layer Connector Synthesis
The heterogeneity characterizing the systems populating the Ubiquitous Computing environment prevents their seamless interoperability. Heterogeneous protocols may be willing to coo...
Paola Inverardi, Romina Spalazzese, Massimo Tivoli
CCS
2004
ACM
15 years 12 months ago
Verifying policy-based security for web services
WS-SecurityPolicy is a declarative configuration language for driving web services security mechanisms. We describe a formal sefor WS-SecurityPolicy, and propose a more abstract ...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
IPPS
1998
IEEE
15 years 10 months ago
A Molecular Quasi-Random Model of Computations Applied to Evaluate Collective Intelligence
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
Tadeusz Szuba
ATAL
2006
Springer
15 years 10 months ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
AIIDE
2008
15 years 8 months ago
Talking with NPCs: Towards Dynamic Generation of Discourse Structures
Dialogue in commercial games is largely created by teams of writers and designers who hand-author every line of dialogue and hand-specify the dialogue structure using finite state...
Christina R. Strong, Michael Mateas