Sciweavers

1094 search results - page 65 / 219
» On Computing Explanations in Argumentation
Sort
View
86
Voted
EUROPAR
2005
Springer
15 years 4 months ago
Replication Predicates for Dependent-Failure Algorithms
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
Flavio Paiva Junqueira, Keith Marzullo
ICIAP
2007
ACM
15 years 11 months ago
A Consistency Result for the Normalized Eight-Point Algorithm
A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data [IEEE Trans. Pattern Anal. Mach. Intell., 25(...
Wojciech Chojnacki, Michael J. Brooks
INFOCOM
2000
IEEE
15 years 3 months ago
The Chaotic Nature of TCP Congestion Control
— In this paper we demonstrate how TCP congestion control can show chaotic behavior. We demonstrate the major features of chaotic systems in TCP/IP networks with examples. These ...
Andras Veres, Miklós Boda
FOGA
1994
15 years 10 days ago
The Schema Theorem and Price's Theorem
Holland's Schema Theorem is widely taken to be the foundation for explanations of the power of genetic algorithms (GAs). Yet some dissent has been expressed as to its implica...
Lee Altenberg
IGPL
2006
90views more  IGPL 2006»
14 years 11 months ago
Surviving Abduction
Abduction or retroduction, as introduced by C.S. Peirce in the double sense of searching for explanatory instances and providing an explanation (i.e., involving the procedure of s...
Walter Alexandre Carnielli