12 search results - page 2 / 3 » Strengthening Admissible Coalitions |
IANDC
2010
13 years 4 months ago
2010
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
INFOCOM
2002
IEEE
13 years 10 months ago
2002
IEEE
— The Assured Forwarding (AF) service of the IETF DiffServ architecture provides a qualitative service differentiation between classes of traffic, in the sense that a low-priori...
ALGORITHMICA
2007
13 years 5 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
JNSM
2010
13 years 11 days ago
2010
This article presents an overview of standards and a survey of recent work on QoS control of next generation networks (NGNs). We outline primarily standardized QoS control architec...
JOC
2007
13 years 5 months ago
2007
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...