Sciweavers

4940 search results - page 733 / 988
» On the Complexity of Universal Programs
Sort
View
DALT
2004
Springer
15 years 12 months ago
Theories of Intentions in the Framework of Situation Calculus
Abstract. We propose an extension of action theories to intention theories in the framework of situation calculus. Moreover the method for implementing action theories is adapted t...
Maria del Pilar Pozos Parra, Abhaya C. Nayak, Robe...
FMCO
2004
Springer
112views Formal Methods» more  FMCO 2004»
15 years 12 months ago
Probabilistic Linda-Based Coordination Languages
Abstract. Coordination languages are intended to simplify the development of complex software systems by separating the coordination aspects of an application from its computation ...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
ICCS
2004
Springer
15 years 12 months ago
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
Hyunseung Choo, Vladimir V. Shakhov
IFIP
2004
Springer
15 years 12 months ago
ATV: An Efficient Method for Constructing a Certification Path
: Constructing a certification path is the mainly method of validating a certificate at given time. The established path will consist of all the valid certificates that reside betw...
Omar Batarfi
IFIP
2004
Springer
15 years 12 months ago
Pattern-Matching Spi-Calculus
Cryptographic protocols often make use of nested cryptographic primitives, for example signed message digests, or encrypted signed messages. Gordon and Jeffrey’s prior work on ty...
Christian Haack, Alan Jeffrey