Sciweavers

4126 search results - page 654 / 826
» Relationships with other Formalisms
Sort
View
KR
2000
Springer
15 years 10 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
AIIA
1995
Springer
15 years 10 months ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung
SPATIALCOGNITION
2000
Springer
15 years 10 months ago
Modelling Navigational Knowledge by Route Graphs
Navigation has always been an interdisciplinary topic of research, because mobile agents of different types are inevitably faced with similar navigational problems. Therefore, huma...
Steffen Werner, Bernd Krieg-Brückner, Theo He...
SPW
2000
Springer
15 years 10 months ago
Users and Trust in Cyberspace
The underlying belief and knowledge models assumed by various kinds of authentication protocols have been studied for well over 10 years now. On the other hand, the related questio...
Pekka Nikander, Kristiina Karvonen
ICTAI
1997
IEEE
15 years 10 months ago
GA-Based Performance Analysis of Network Protocols
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...
Mario Baldi, Fulvio Corno, Maurizio Rebaudengo, Gi...