Sciweavers

2517 search results - page 258 / 504
» Specifying Weak Sets
Sort
View
IAT
2009
IEEE
15 years 10 months ago
On-line Coordination: Event Interaction and State Communication between Cooperative Agents
This paper addresses a novel coordination problem for distributed agents in a discrete-event setting. We introduce and study a predicate coordination problem as the problem of dist...
Manh Tung Pham, Kiam Tian Seow
CINQ
2004
Springer
182views Database» more  CINQ 2004»
15 years 10 months ago
Mining Constrained Graphs: The Case of Workflow Systems
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, ...
ATAL
2006
Springer
15 years 10 months ago
Agent interface enhancement: making multiagent graphical models accessible
Multiagent probabilistic reasoning with multiply sectioned Bayesian networks requires interfacing agent subnets (the modeling task) subject to a set of conditions. To specify the ...
Yang Xiang, Kun Zhang
167
Voted
COCOON
2006
Springer
15 years 10 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
CPAIOR
2006
Springer
15 years 10 months ago
The Range Constraint: Algorithms and Implementation
Abstract. We recently proposed a simple declarative language for specifying a wide range of counting and occurrence constraints. The language uses just two global primitives: the R...
Christian Bessière, Emmanuel Hebrard, Brahi...