Sciweavers

1712 search results - page 43 / 343
» A Computational Approach to Binding Theory
Sort
View
ASIAN
2006
Springer
134views Algorithms» more  ASIAN 2006»
15 years 3 months ago
Computational Soundness of Formal Indistinguishability and Static Equivalence
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
Gergei Bana, Payman Mohassel, Till Stegers
LCN
2006
IEEE
15 years 5 months ago
On Measuring Anonymity For Wireless Mobile Ad-hoc Networks
We propose an evidence theory based anonymity measuring approach for wireless mobile ad-hoc networks. In our approach, an evidence is a measure of the number of detected packets w...
Dijiang Huang
ECOWS
2011
Springer
13 years 11 months ago
Automating the Generation of Web Service Testbeds Using AOP
Abstract—One of the key concepts of service-oriented computing is dynamic binding which favors on-demand integration of services into a running system. Companies can outsource ta...
Lukasz Juszczyk, Schahram Dustdar
FOSSACS
1998
Springer
15 years 4 months ago
Generalizing Domain Theory
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...
Michael W. Mislove
FLAIRS
2008
15 years 2 months ago
On the Compilation of Possibilistic Default Theories
Handling exceptions represents one of the most important problems in Artificial Intelligence. Several approaches have been proposed for reasoning on default theories. This paper f...
Salem Benferhat, Safa Yahi, Habiba Drias