2356 search results - page 255 / 472 » Characterizations of postman sets |
197
click to vote
NMR
2004
Springer
15 years 12 months ago
2004
Springer
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...
198
click to vote
WDAG
2004
Springer
15 years 12 months ago
2004
Springer
In a Byzantine agreement protocol, a synchronous network of n interconnected processes of which t may be faulty, starts with an initial binary value associated with each process; a...
180
click to vote
APN
2010
Springer
15 years 11 months ago
2010
Springer
Service-oriented computing proposes services as building blocks which can be composed to complex systems. To reason about the correctness of a service, its communication protocol n...
191
click to vote
COLT
2001
Springer
15 years 11 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
183
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...