4095 search results - page 19 / 819 » How to test a tree |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
ICSE
2009
IEEE-ACM
13 years 5 months ago
2009
IEEE-ACM
Software security issues have been a major concern to the cyberspace community, so a great deal of research on security testing has been performed, and various security testing te...
TCAD
2011
13 years 2 months ago
2011
—Pre-bond testing of 3-D stacked integrated circuits (ICs) involves testing each individual die before bonding. The overall yield of 3-D ICs improves with pre-bond testability be...
HM
2007
Springer
14 years 1 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
TALG
2008
13 years 7 months ago
2008
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...