3928 search results - page 391 / 786 » order 2006 |
189
Voted
DM
2006
15 years 7 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
225
Voted
DPD
2006
15 years 7 months ago
2006
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
205
click to vote
ENTCS
2006
15 years 7 months ago
2006
Organizational models have been recently used in agent theory for modeling coordination in open systems and to ensure social order in multi-agent system applications. In this pape...
184
click to vote
ENTCS
2006
15 years 7 months ago
2006
Motivated by the concerns of theorem-proving, we generalise the notion of proof tree to that of hierarchical proof tree. Hierarchical trees extend ordinary trees by adding partial...
204
click to vote
ENTCS
2006
15 years 7 months ago
2006
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...