Sciweavers

160 search results - page 9 / 32
» Definition and Complexity of Some Basic Metareasoning Proble...
Sort
View
DATAMINE
2002
169views more  DATAMINE 2002»
13 years 7 months ago
Advances in Instance Selection for Instance-Based Learning Algorithms
The basic nearest neighbour classifier suffers from the indiscriminate storage of all presented training instances. With a large database of instances classification response time ...
Henry Brighton, Chris Mellish
FLOPS
2006
Springer
13 years 11 months ago
Convergence in Language Design: A Case of Lightning Striking Four Times in the Same Place
What will a definitive programming language look like? By definitive language I mean a programming language that gives good soat its level of abstraction, allowing computer science...
Peter Van Roy
JCO
2008
85views more  JCO 2008»
13 years 7 months ago
Locating and detecting arrays for interaction faults
The identification of interaction faults in component-based systems has focussed on indicating the presence of faults, rather than their location and magnitude. While this is a va...
Charles J. Colbourn, Daniel W. McClary
IEEECIT
2005
IEEE
14 years 1 months ago
Management and Retrieval of Web Services Based on Formal Concept Analysis
After introducing some basic concepts of Web services and the definition of their relationships, we formally define the problem of managing and retrieving of Web services. This pa...
Dunlu Peng, Sheng Huang, Xiaoling Wang, Aoying Zho...
ICMAS
1998
13 years 8 months ago
Principles of Trust for MAS: Cognitive Anatomy, Social Importance, and Quantification
After arguing about the crucial importance of trust for Agents and MAS, we provide a definition of trust both as a mental state and as a social attitude and relation. We present t...
Cristiano Castelfranchi, Rino Falcone