Sciweavers

148 search results - page 1 / 30
» Exploiting Parallelism for Hard Problems in Abstract Argumen...
Sort
View
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
13 years 6 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz
AAAI
1994
13 years 6 months ago
An Instructional Environment for Practicing Argumentation Skills
CAT0 is an instructions environment for practicing basic skills of legal research: to use cases in arguments about a problem situation and to test a theory about a legal domain. U...
Vincent Aleven, Kevin D. Ashley
AI
2007
Springer
13 years 4 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
IFIPPACT
1994
13 years 6 months ago
Exploiting the Parallelism Exposed by Partial Evaluation
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
Rajeev J. Surati, Andrew A. Berlin
AP2PC
2004
Springer
13 years 10 months ago
On Exploiting Agent Technology in the Design of Peer-to-Peer Applications
Abstract. Peer-to-peer (P2P) architectures exhibit attractive properties for a wide range of real world systems. As a result they are increasingly being applied in the design of ap...
Steven Willmott, Josep M. Pujol, Ulises Cort&eacut...