Sciweavers

1404 search results - page 4 / 281
» Complexity of admissible rules
Sort
View
CIA
2004
Springer
14 years 3 months ago
Reasoning About Communication - A Practical Approach Based on Empirical Semantics
Given a specification of communication rules in a multiagent system (in the form of protocols, ACL semantics, etc.), the question of how to design appropriate agents that can oper...
Felix A. Fischer, Michael Rovatsos
AAAI
1998
13 years 11 months ago
Complexity Analysis of Admissible Heuristic Search
Richard E. Korf, Michael Reid
IJNM
2008
103views more  IJNM 2008»
13 years 9 months ago
An efficient architecture for Bandwidth Brokers in DiffServ networks
In this article we examine the architecture of an entity used for automatic management and provisioning of resources for DiffServ networks. We examine the existing literature and ...
Christos Bouras, Kostas Stamos
ECAI
2008
Springer
13 years 11 months ago
Single-peaked consistency and its complexity
Abstract. A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known such restriction is...
Bruno Escoffier, Jérôme Lang, Meltem ...
MSCS
2008
119views more  MSCS 2008»
13 years 9 months ago
Structural subtyping for inductive types with functorial equality rules
Subtyping for inductive types in dependent type theories is studied in the framework of coercive subtyping. General structural subtyping rules for parameterised inductive types ar...
Zhaohui Luo, Robin Adams