Sciweavers

2796 search results - page 538 / 560
» The coolest path problem
Sort
View
KDD
2010
ACM
240views Data Mining» more  KDD 2010»
15 years 3 months ago
Diagnosing memory leaks using graph mining on heap dumps
Memory leaks are caused by software programs that prevent the reclamation of memory that is no longer in use. They can cause significant slowdowns, exhaustion of available storag...
Evan K. Maxwell, Godmar Back, Naren Ramakrishnan
AAAI
2010
15 years 1 months ago
Searching Without a Heuristic: Efficient Use of Abstraction
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
Bradford John Larsen, Ethan Burns, Wheeler Ruml, R...
CIC
2004
118views Communications» more  CIC 2004»
15 years 1 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
WSC
2000
15 years 1 months ago
A comparison of five steady-state truncation heuristics for simulation
We compare the performance of five well-known truncation heuristics for mitigating the effects of initialization bias in the output analysis of steady-state simulations. Two of th...
K. Preston White, Michael J. Cobb, Stephen C. Spra...
BIRTHDAY
2010
Springer
15 years 27 days ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman