Sciweavers

2022 search results - page 73 / 405
» Complexity of Non-Monotonic Logics
Sort
View
76
Voted
LOGCOM
2010
96views more  LOGCOM 2010»
14 years 11 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
97
Voted
ICML
2000
IEEE
16 years 1 months ago
Classification of Individuals with Complex Structure
This paper introduces a foundation for inductive learning based on the use of higher-order logic for knowledge representation. In particular, the paper (i) provides a systematic i...
Antony F. Bowers, Christophe G. Giraud-Carrier, Jo...
87
Voted
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
15 years 6 months ago
Complexity Analysis of H.264 Decoder for FPGA Design
— A major challenge in the design of any real time system is the proper selection of implementation and platform alternatives. In this paper, a suitable FPGA-based design of the ...
Tuomas Lindroth, Nastooh Avessta, Jukka Teuhola, T...
105
Voted
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
15 years 6 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
NPAR
2004
ACM
15 years 6 months ago
Rendering complexity in computer-generated pen-and-ink illustrations
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
Brett Wilson, Kwan-Liu Ma