4095 search results - page 188 / 819 » How to test a tree |
71
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...
94
Voted
GD
2009
Springer
15 years 5 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
126
Voted
CGF
2011
14 years 4 months ago
2011
We accelerate the finding of occluders in tree based acceleration structures, such as a packetized BVH and a single ray kd-tree, by deriving the ray termination surface area heur...
113
Voted
TSE
2008
15 years 10 days ago
2008
Test adequacy criteria provide the engineer with guidance on how to populate test suites. While adequacy criteria have long been a focus of research, existing testing methods do no...
ICSE
2008
IEEE-ACM
16 years 1 months ago
2008
IEEE-ACM
Pervasive computing software adapts its behavior according to the changing contexts. Nevertheless, contexts are often noisy. Context inconsistency resolution provides a cleaner pe...