169 search results - page 15 / 34 » Counting paths in digraphs |
102
click to vote
ISSTA
1989
ACM
15 years 5 months ago
1989
ACM
The all-du-paths software testing criterion is the most discriminating of the data ow testing criteria of Rapps and Weyuker. Unfortunately, in the worst case, the criterion requir...
121
Voted
EJC
2011
14 years 8 months ago
2011
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...
109
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—Knowledge of the network path properties such as latency, hop count, loss and bandwidth is key to the performance of overlay networks, grids and p2p applications. Network operat...
113
Voted
ANCS
2009
ACM
14 years 11 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
96
Voted
FPGA
2008
ACM
15 years 3 months ago
2008
ACM
This paper presents a new technology mapper, WireMap. The mapper uses an edge flow heuristic to improve the routability of a mapped design. The heuristic is applied during the ite...