Sciweavers

2436 search results - page 47 / 488
» Comonadic Notions of Computation
Sort
View
ESAW
2006
Springer
14 years 1 months ago
A Definition of Exceptions in Agent-Oriented Computing
The research on exception handling in Multi-Agent Systems has produced some advanced models to deal with `exceptional situations'. The expression `agent exception' is how...
Eric Platon, Nicolas Sabouret, Shinichi Honiden
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
FLAIRS
2003
13 years 11 months ago
On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings
IBERAMIA
2010
Springer
13 years 7 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
SASO
2008
IEEE
14 years 4 months ago
Spatial Computing with Labels
— A reconfigurable robot is a robot that can change shape. Programming reconfigurable robots is complicated by the need to adapt the behavior of each of the individual module t...
Ulrik Pagh Schultz, Mirko Bordignon, David Johan C...