Sciweavers

1129 search results - page 79 / 226
» Finding Similar Failures Using Callstack Similarity
Sort
View
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 8 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
JSSPP
2009
Springer
14 years 2 months ago
Scheduling Restartable Jobs with Short Test Runs
In this paper, we examine the concept of giving every job a trial run before committing it to run until completion. Trial runs allow immediate job failures to be detected shortly a...
Ojaswirajanya Thebe, David P. Bunde, Vitus J. Leun...
ATVA
2010
Springer
284views Hardware» more  ATVA 2010»
13 years 9 months ago
YAGA: Automated Analysis of Quantitative Safety Specifications in Probabilistic B
Probabilistic B (pB) [2, 8] extends classical B [7] to incorporate probabilistic updates together with the specification of quantitative safety properties. As for classical B, prob...
Ukachukwu Ndukwu, A. K. McIver
ICDCN
2010
Springer
13 years 6 months ago
K-Directory Community: Reliable Service Discovery in MANET
Abstract. Service discovery in MANET suffers from frequent service unavailability due to failures of service providers or directory nodes. Ensuring network-wide service availabilit...
Vaskar Raychoudhury, Jiannong Cao, Weigang Wu, Yi ...
VLDB
2003
ACM
165views Database» more  VLDB 2003»
14 years 8 months ago
Learning to match ontologies on the Semantic Web
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
AnHai Doan, Jayant Madhavan, Robin Dhamankar, Pedr...