Sciweavers

1856 search results - page 371 / 372
» Formal Dialectic Specification
Sort
View
LOGCOM
2010
154views more  LOGCOM 2010»
13 years 1 days ago
Collaborative Runtime Verification with Tracematches
Perfect pre-deployment test coverage is notoriously difficult to achieve for large applications. Given enough end users, however, many more test cases will be encountered during a...
Eric Bodden, Laurie J. Hendren, Patrick Lam, Ondre...
SPEECH
2010
80views more  SPEECH 2010»
13 years 3 hour ago
The Nijmegen Corpus of Casual French
This article describes the preparation, recording and orthographic transcription of a new speech corpus, the Nijmegen Corpus of Casual French (NCCFr). The corpus contains a total ...
Francisco Torreira, Martine Adda-Decker, Mirjam Er...
TSMC
2010
12 years 12 months ago
Probabilistic Model-Based Diagnosis: An Electrical Power System Case Study
Abstract--We present in this paper a case study of the probabilistic approach to model-based diagnosis. Here, the diagnosed system is a real-world electrical power system (EPS), i....
Ole J. Mengshoel, Mark Chavira, Keith Cascio, Scot...
SIGIR
2011
ACM
12 years 8 months ago
Find it if you can: a game for modeling different types of web search success using interaction data
A better understanding of strategies and behavior of successful searchers is crucial for improving the experience of all searchers. However, research of search behavior has been s...
Mikhail Ageev, Qi Guo, Dmitry Lagun, Eugene Agicht...
WWW
2003
ACM
14 years 6 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...