Sciweavers

166 search results - page 6 / 34
» Comparison of two approaches to approximated reasoning
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Emotion based adaptive reasoning for resource bounded agents
In the design of resource bounded agents, high-level cognitive activities, such as reasoning, raise important problems related both to the adaptive ability and to the computationa...
Luís Morgado, Graça Gaspar
AI
2008
Springer
13 years 8 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
ICCBR
2005
Springer
14 years 1 months ago
P2P Case Retrieval with an Unspecified Ontology
Traditional CBR approaches imply centralized storage of the case base and, most of them, the retrieval of similar cases by an exhaustive comparison of the case to be solved with th...
Shlomo Berkovsky, Tsvi Kuflik, Francesco Ricci
FLOPS
1999
Springer
14 years 1 days ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer
BMCBI
2005
158views more  BMCBI 2005»
13 years 7 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney