2214 search results - page 253 / 443 » Complexity of Reasoning |
158
Voted
PCM
2005
Springer
15 years 9 months ago
2005
Springer
In general, motion compensated (MC) deinterlacing algorithms can outperform non-MC (NMC) ones. However, we often prefer to choose the latter due to the considerations of error prop...
104
Voted
LPNMR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
130
Voted
AGP
2003
IEEE
15 years 9 months ago
2003
IEEE
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
113
Voted
HICSS
2002
IEEE
15 years 8 months ago
2002
IEEE
The threat of abandoned or extensively overhauled IS is a major concern for both MIS specialists and businesses. This concern may stem from the mismatch between MIS specialist cha...
126
Voted
ICPP
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...