2436 search results - page 47 / 488 » Comonadic Notions of Computation |
143
Voted
ESAW
2006
Springer
15 years 7 months ago
2006
Springer
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...
130
Voted
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
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...
102
Voted
FLAIRS
2003
15 years 5 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
174
Voted
IBERAMIA
2010
Springer
15 years 1 months ago
2010
Springer
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...
146
click to vote
SASO
2008
IEEE
15 years 10 months ago
2008
IEEE
— 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...