Sciweavers

6599 search results - page 29 / 1320
» Towards a Theory of Information
Sort
View
ICALP
2010
Springer
15 years 2 months ago
Towards a Theory of Time-Bounded Verification
Abstract. We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue ...
Joël Ouaknine, James Worrell
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 3 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
NORDSEC
2009
Springer
15 years 8 months ago
Towards Practical Enforcement Theories
Runtime enforcement is a common mechanism for ensuring that program executions adhere to constraints specified by a security policy. It is based on two simple ideas: the enforceme...
Nataliia Bielova, Fabio Massacci, Andrea Michelett...
124
Voted
AINA
2007
IEEE
15 years 8 months ago
Using Social Network Theory Towards Development of Wireless Ad Hoc Network Trust
The evolution and existence of stable trust relations have been studied extensively in the context of social theory. However, reputation systems or trust schemes have only been re...
Sameer Pai, Tanya Roosta, Stephen B. Wicker, Shank...
ATAL
2005
Springer
15 years 7 months ago
Towards a theory of "local to global" in distributed multi-agent systems (II)
a growing need to study abstract problems in distributed multi-agent systems in a systematic way, as well as to provide a qualitative mathematical framework in which to compare po...
Daniel Yamins