Sciweavers

42 search results - page 1 / 9
» Computational properties of argument systems satisfying grap...
Sort
View
AI
2007
Springer
13 years 11 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
ATAL
2011
Springer
12 years 10 months ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...
AGENTS
2001
Springer
14 years 3 months ago
Argumentation as distributed constraint satisfaction: applications and results
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or ju...
Hyuckchul Jung, Milind Tambe, Shriniwas Kulkarni
ISCAS
2007
IEEE
99views Hardware» more  ISCAS 2007»
14 years 5 months ago
A Parallel Architecture for Hermitian Decoders: Satisfying Resource and Throughput Constraints
— Hermitian Codes offer desirable properties such as large code lengths, good error-correction at high code rates, etc. The main problem in making Hermitian codes practical is to...
Rachit Agarwal, Emanuel M. Popovici, Brendan O'Fly...
ACL
2012
12 years 1 months ago
Sentence Compression with Semantic Role Constraints
For sentence compression, we propose new semantic constraints to directly capture the relations between a predicate and its arguments, whereas the existing approaches have focused...
Katsumasa Yoshikawa, Ryu Iida, Tsutomu Hirao, Mana...