Sciweavers

1998 search results - page 164 / 400
» Basic Association Rules
Sort
View
ICWS
2008
IEEE
15 years 5 months ago
Extending WS-Notification with an Expressive Event Notification Broker
Web service applications integrate explicit client-service interactions with notification-style programming. Such event-driven interactions are often called implicit invocations b...
Sven De Labey, Eric Steegmans
WSC
1998
15 years 5 months ago
The DoD High Level Architecture: an update
The High Level Architecture (HLA) provides the specification of a common technical architecture for use across all classes of simulations in the US Department of Defense. It provi...
Judith S. Dahmann, Richard Fujimoto, Richard M. We...
CLIMA
2010
15 years 4 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh
ENTCS
2007
126views more  ENTCS 2007»
15 years 3 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
FUIN
2002
107views more  FUIN 2002»
15 years 3 months ago
Towards an Ontology of Approximate Reason
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...
James F. Peters, Andrzej Skowron, Jaroslaw Stepani...