Sciweavers

988 search results - page 2 / 198
» Pseudo-Genetic Algorithmic Composition
Sort
View
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
13 years 10 months ago
Information-theoretically secure protocols and security under composition
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these ...
Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
ISDA
2009
IEEE
13 years 11 months ago
A Genetic Programming-Based Algorithm for Composing Web Services
—Web Services are interfaces that describe a collection of operations that are network-accessible through standardized web protocols. When a required operation is not found, seve...
Manuel Mucientes, Manuel Lama, Miguel I. Couto
WDAG
2001
Springer
100views Algorithms» more  WDAG 2001»
13 years 9 months ago
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space c...
Faith E. Fich, Colette Johnen
PLDI
2006
ACM
13 years 10 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann
TES
2005
Springer
13 years 10 months ago
SENECA - Simulation of Algorithms for the Selection of Web Services for Compositions
This paper discusses a combinatorial problem about the selection of candidates for Web service compositions. The problem occurs if we assume that a discovery process has identifi...
Michael C. Jaeger, Gregor Rojec-Goldmann