7913 search results - page 314 / 1583 » Information Collection on a Graph |
125
click to vote
SIGSOFT
2005
ACM
16 years 4 months ago
2005
ACM
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry fu...
216
click to vote
CP
2009
Springer
16 years 4 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
119
Voted
TACAS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
111
Voted
ECOOP
2006
Springer
15 years 7 months ago
2006
Springer
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...
143
click to vote
TSP
2008
15 years 3 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...