Sciweavers

763 search results - page 123 / 153
» Engineering Shortest Path Algorithms
Sort
View
VSTTE
2012
Springer
12 years 3 months ago
Infeasible Code Detection
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
Cristiano Bertolini, Martin Schäf, Pascal Sch...
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 4 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
MST
2010
146views more  MST 2010»
13 years 2 months ago
The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation
We consider triply-nested loops of the type that occur in the standard Gaussian elimination algorithm, which we denote by GEP (or the Gaussian Elimination Paradigm). We present tw...
Rezaul Alam Chowdhury, Vijaya Ramachandran
CODES
2009
IEEE
13 years 8 months ago
Efficient dynamic voltage/frequency scaling through algorithmic loop transformation
We present a novel loop transformation technique, particularly well suited for optimizing embedded compilers, where an increase in compilation time is acceptable in exchange for s...
Mohammad Ali Ghodrat, Tony Givargis
SCAM
2008
IEEE
14 years 2 months ago
Precise Analysis of Java Programs Using JOANA
The JOANA project (Java Object-sensitive ANAlysis) is a program analysis infrastructure for the Java language. It contains a wide range of analysis techniques such as dependence g...
Dennis Giffhorn, Christian Hammer