Sciweavers

105
Voted
AUSAI
2015
Springer
9 years 11 months ago
Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search
Abstract. BFS and DFS are the two most fundamental search algorithms. We derive approximations of their expected runtimes in complete trees, as a function of tree depth and probabi...
Tom Everitt, Marcus Hutter
155
Voted
PPPJ
2015
ACM
9 years 11 months ago
Runtime Code Generation and Data Management for Heterogeneous Computing in Java
GPUs (Graphics Processing Unit) and other accelerators are nowadays commonly found in desktop machines, mobile devices and even data centres. While these highly parallel processor...
Juan José Fumero, Toomas Remmelg, Michel St...
122
Voted
PPPJ
2015
ACM
9 years 11 months ago
Identifying Test Refactoring Candidates with Assertion Fingerprints
Test cases constitute around 30% of the codebase of a number of large software systems. Poor design of test suites hinders test comprehension and maintenance. Developers often cop...
Zheng Felix Fang, Patrick Lam
124
Voted
PPPJ
2015
ACM
9 years 11 months ago
Improving the Interoperation between Generics Translations
Generics on the Java platform are compiled using the erasure transformation, which only supports by-reference values. This causes slowdowns when generics operate on primitive type...
Vlad Ureche, Milos Stojanovic, Romain Beguet, Nico...
92
Voted
PPOPP
2015
ACM
9 years 11 months ago
Exploiting communication concurrency on high performance computing systems
Although logically available, applications may not exploit enough instantaneous communication concurrency to maximize hardware utilization on HPC systems. This is exacerbated in h...
Nicholas Chaimov, Khaled Z. Ibrahim, Samuel Willia...