Sciweavers

1676 search results - page 252 / 336
» Formal Development of Self-organising Systems
Sort
View
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
15 years 4 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
ICTAI
2009
IEEE
15 years 4 months ago
Change Tracer: Tracking Changes in Web Ontologies
Knowledge constantly grows in scientific discourse and is revised over time by domain experts. The body of knowledge will get structured and refined as the Communities of Practice...
Asad Masood Khattak, Khalid Latif, Manhyung Han, S...
INFOCOM
2009
IEEE
15 years 4 months ago
Impacts of Peer Characteristics on P2PTV Networks Scalability
—A P2PTV system allows users to watch live video streams redistributed by other users via a peer-to-peer (P2P) network. In an ideal world, each peer in a P2P network would be abl...
Khaldoon Shami, Damien Magoni, Hyunseok Chang, Wen...
NCA
2007
IEEE
15 years 4 months ago
Implementing Atomic Data through Indirect Learning in Dynamic Networks
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and...
Kishori M. Konwar, Peter M. Musial, Nicolas C. Nic...
SEFM
2007
IEEE
15 years 4 months ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook