4095 search results - page 288 / 819 » How to test a tree |
125
Voted
ICSE
2011
IEEE-ACM
14 years 4 months ago
2011
IEEE-ACM
Parallel programs are difficult to write, test, and debug. This thesis explores how programmers build mental models about parallel programs, and demonstrates, through user evaluat...
114
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
114
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
HSNMC
2004
Springer
15 years 6 months ago
2004
Springer
We study a new approach to provide an efficient VoD service to a large client population in P2P networks. Previous work has suggested to construct a multicast tree to distribute t...
110
Voted
LPAR
2004
Springer
15 years 6 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...