Sciweavers

528 search results - page 94 / 106
» Fault-tolerant analysis of a class of networks
Sort
View
LPAR
2007
Springer
14 years 1 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
WADS
2007
Springer
89views Algorithms» more  WADS 2007»
14 years 1 months ago
Dynamic TCP Acknowledgment with Sliding Window
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
Hisashi Koga
ETFA
2006
IEEE
14 years 1 months ago
Investigating Connector Faults in the Time-Triggered Architecture
In the context of distributed real-time systems as deployed in the avionic and the automotive domain a substantial number of system malfunctions result from connector faults. For ...
Philipp Peti, Roman Obermaisser, Harald Paulitsch
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
COMPULOG
1999
Springer
13 years 11 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh