1187 search results - page 47 / 238 » Computation in Extended Argumentation Frameworks |
CSL
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
STOC
1997
ACM
14 years 21 days ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
ACSC
2006
IEEE
14 years 2 months ago
2006
IEEE
Incorporating constraints into a reactive BDI agent programming language can lead to better expressive capabilities as well as more efficient computation (in some instances). More...
PG
2002
IEEE
14 years 1 months ago
2002
IEEE
The recent non-uniform subdivision approach extends traditional uniform subdivision schemes with variable rules, offering additional shape parameters (such as knot spacings) for f...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...