Sciweavers

1486 search results - page 277 / 298
» Algorithms for two-box covering
Sort
View
ATVA
2006
Springer
102views Hardware» more  ATVA 2006»
13 years 11 months ago
A Semantic Framework for Test Coverage
Abstract. Since testing is inherently incomplete, test selection is of vital importance. Coverage measures evaluate the quality of a test suite and help the tester select test case...
Laura Brandán Briones, Ed Brinksma, Mari&eu...
CGO
2006
IEEE
13 years 11 months ago
Profiling over Adaptive Ranges
Modern computer systems are called on to deal with billions of events every second, whether they are instructions executed, memory locations accessed, or packets forwarded. This p...
Shashidhar Mysore, Banit Agrawal, Timothy Sherwood...
TACAS
2000
Springer
149views Algorithms» more  TACAS 2000»
13 years 11 months ago
Proof General: A Generic Tool for Proof Development
This note describes Proof General, a tool for developing machine proofs with an interactive proof assistant. Interaction is based around a proof script, which is the target of a pr...
David Aspinall
CIKM
2008
Springer
13 years 9 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
COCOON
2008
Springer
13 years 9 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi