Sciweavers

1523 search results - page 145 / 305
» Partially ordered secretaries
Sort
View
ICEIS
2000
IEEE
15 years 5 months ago
Syntax-Directed Translation Schemes for Multi-Agent Systems Conversation Modelling
: In modern organisations the monolithic information systems of the past are being gradually replaced by networked systems, enabling distributed computing often based on multi-agen...
Ana L. N. Fred, Joaquim Filipe
LCN
1999
IEEE
15 years 5 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
ICTL
1994
15 years 5 months ago
Abduction in Temporal Reasoning
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Cristina Ribeiro, António Porto
PEPM
1993
ACM
15 years 5 months ago
Tutorial on Specialisation of Logic Programs
In this tutorial the specialisation of declarative logic programs is presented. The main correctness results are given, and the outline of a basic algorithm for partial evaluation...
John P. Gallagher
APN
2006
Springer
15 years 4 months ago
Can I Execute My Scenario in Your Net? VipTool Tells You!
This paper describes the verification module (the VipVerify Module) of the VipTool [4]. VipVerify allows to verify whether a given scenario is an execution of a system model, given...
Robin Bergenthum, Jörg Desel, Gabriel Juh&aac...