Sciweavers

141 search results - page 21 / 29
» Approximate Reasoning about Combined Knowledge
Sort
View
ENTCS
2007
143views more  ENTCS 2007»
13 years 10 months ago
Formal Fault Tree Analysis - Practical Experiences
Safety is an important requirement for many modern systems. To ensure safety of complex critical systems, well-known safety analysis methods have been formalized. This holds in pa...
Frank Ortmeier, Gerhard Schellhorn
AAAI
2007
14 years 22 days ago
An Investigation into Computational Recognition of Children's Jokes
bstract or nonliving entities act or are described as living. And living things gain extra benefits such as animals talking. For this reason, the standard scripts are modified to a...
Julia M. Taylor, Lawrence J. Mazlack
TPCD
1994
157views Hardware» more  TPCD 1994»
13 years 11 months ago
Non-Restoring Integer Square Root: A Case Study in Design by Principled Optimization
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
John W. O'Leary, Miriam Leeser, Jason Hickey, Mark...
AIPS
2003
13 years 11 months ago
A Framework for Planning with Extended Goals under Partial Observability
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
Piergiorgio Bertoli, Alessandro Cimatti, Marco Pis...
EWMF
2003
Springer
14 years 3 months ago
Semantically Enhanced Collaborative Filtering on the Web
Item-based Collaborative Filtering (CF) algorithms have been designed to deal with the scalability problems associated with traditional user-based CF approaches without sacrificin...
Bamshad Mobasher, Xin Jin, Yanzan Zhou