Sciweavers

2989 search results - page 191 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
WWW
2007
ACM
15 years 11 months ago
Using Google distance to weight approximate ontology matches
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
Risto Gligorov, Warner ten Kate, Zharko Aleksovski...
89
Voted
FORMATS
2005
Springer
15 years 3 months ago
Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets
Monitoring real-time concurrent systems is a challenging task. In this paper we formulate (model-based) supervision by means of hidden state history reconstruction, from event (e.g...
Thomas Chatain, Claude Jard
60
Voted
AIED
2005
Springer
15 years 3 months ago
Analyzing Completeness and Correctness of Utterances Using an ATMS
Analyzing coverage of a student’s utterance or essay (completeness) and diagnosing errors (correctness) can be treated as a diagnosis problem and solved using a well-known techni...
Maxim Makatchev, Kurt VanLehn
89
Voted
CAP
2010
14 years 5 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
92
Voted
CORR
2008
Springer
179views Education» more  CORR 2008»
14 years 10 months ago
Practical Automated Partial Verification of Multi-Paradigm Real-Time Models
This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational...
Carlo A. Furia, Matteo Pradella, Matteo Rossi