Sciweavers

2252 search results - page 394 / 451
» Improving Random Forests
Sort
View
ASPLOS
2004
ACM
14 years 2 months ago
Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign
Tracing garbage collectors traverse references from live program variables, transitively tracing out the closure of live objects. Memory accesses incurred during tracing are essen...
Chen-Yong Cher, Antony L. Hosking, T. N. Vijaykuma...
SIGSOFT
2004
ACM
14 years 2 months ago
Correlation exploitation in error ranking
Static program checking tools can find many serious bugs in software, but due to analysis limitations they also frequently emit false error reports. Such false positives can easi...
Ted Kremenek, Ken Ashcraft, Junfeng Yang, Dawson R...
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
14 years 2 months ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 2 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
MOBICOM
2003
ACM
14 years 2 months ago
Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED
Significant TCP unfairness in ad hoc wireless networks has been reported during the past several years. This unfairness results from the nature of the shared wireless medium and ...
Kaixin Xu, Mario Gerla, Lantao Qi, Yantai Shu