Sciweavers

250 search results - page 14 / 50
» Fixed Argument Pairings
Sort
View
PDPTA
2007
13 years 11 months ago
Communication with Super Flexible Messaging
Abstract Super Flexible Messaging (SFM) provides a powerful and elegant message passing abstraction for transferring arbitrary data between remote processes. SFM achieves the simpl...
Alexey Fedosov, Gregory Benson
AIMS
2008
Springer
13 years 12 months ago
A Distributed Certification System for Structured P2P Networks
In this paper, we present a novel distributed certification system in which signing a certificate needs the collaboration of a fixed ratio of the nodes, hence a varying number of n...
François Lesueur, Ludovic Mé, Val&ea...
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
13 years 10 months ago
Classifying Descents According to Equivalence mod k
In [5] the authors refine the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. In this paper, we generalize the results o...
Sergey Kitaev, Jeffrey B. Remmel
FROCOS
2007
Springer
14 years 4 months ago
Proving Termination Using Recursive Path Orders and SAT Solving
We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers pe...
Peter Schneider-Kamp, René Thiemann, Elena ...
DAGSTUHL
2007
13 years 11 months ago
Two-Dimensional Belief Change
ABSTRACT: In this paper I present the model of ‘bounded revision’ that is based on two-dimensional revision functions taking as arguments pairs consisting of an input sentence ...
Hans Rott