Sciweavers

2934 search results - page 240 / 587
» Universality in Multi-Agent Systems
Sort
View
FOSSACS
2010
Springer
16 years 1 months ago
Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de Simone SOS format. Our coinduction is incremental, in that it allows building in...
Andrei Popescu, Elsa L. Gunter
RSFDGRC
2005
Springer
133views Data Mining» more  RSFDGRC 2005»
16 years 1 days ago
Rough Set Approximation Based on Dynamic Granulation
In this paper, the concept of a granulation order is proposed in an information system. The positive approximation of a set under a granulation order is defined. Some properties o...
Jiye Liang, Yuhua Qian, Chengyuan Chu, Deyu Li, Ju...
DSN
2000
IEEE
15 years 11 months ago
Experiences with Group Communication Middleware
Group communication is a widely studied paradigm for building fault-tolerant distributed systems. The Armada project at the University of Michigan is a collaborative effort with t...
Scott Johnson, Farnam Jahanian, Sunondo Ghosh, Bri...
CTCS
1997
Springer
15 years 10 months ago
Monads and Modular Term Rewriting
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
Christoph Lüth, Neil Ghani
PATAT
2000
Springer
103views Education» more  PATAT 2000»
15 years 10 months ago
Examination Timetables and Tabu Search with Longer-Term Memory
The examination scheduling problem has been examined and a four-phase system using a tabu search algorithm, OTTABU, has been implemented. This system uses both recency-based short-...
George M. White, Bill S. Xie