Sciweavers

153 search results - page 2 / 31
» Uniformity Testing Using Minimal Spanning Tree
Sort
View
ICTAC
2004
Springer
13 years 10 months ago
Minimal Spanning Set for Coverage Testing of Interactive Systems
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
Fevzi Belli, Christof J. Budnik
EOR
2006
130views more  EOR 2006»
13 years 4 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
GIS
2006
ACM
14 years 5 months ago
Recognition of island structures for map generalization
In this paper we describe work on the automatic recognition of island structures. In an initial phase several test persons were asked to mark groups of islands that they perceived...
Stefan Steiniger, Dirk Burghardt, Robert Weibel
FOCS
2009
IEEE
13 years 11 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
13 years 8 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh