Sciweavers

4978 search results - page 271 / 996
» Logical models of argument
Sort
View
LOGCOM
1998
132views more  LOGCOM 1998»
15 years 5 months ago
Agents That Reason and Negotiate by Arguing
The need for negotiation in multi-agent systems stems from the requirement for agents to solve the problems posed by their interdependence upon one another. Negotiation provides a...
Simon Parsons, Carles Sierra, Nicholas R. Jennings
UTP
2010
15 years 3 months ago
Specification Coverage for Testing in Circus
Abstract. The Unifying Theories of Programming underpins the development of Circus, a state-rich process algebra for refinement. We have previously presented a theory of testing fo...
Ana Cavalcanti, Marie-Claude Gaudel
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 29 days ago
Lower bound for deterministic semantic-incremental branching programs solving GEN
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
Dustin Wehr
EUROCRYPT
2011
Springer
14 years 9 months ago
Unbounded HIBE and Attribute-Based Encryption
In this work, we present HIBE and ABE schemes which are “unbounded” in the sense that the public parameters do not impose additional limitations on the functionality of the sy...
Allison B. Lewko, Brent Waters
174
Voted
INFOCOM
2011
IEEE
14 years 9 months ago
Scheduling for small delay in multi-rate multi-channel wireless networks
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM-based) wireless downlink systems. We show that the Server-Side Greedy (SSG) rul...
Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R...