Sciweavers

18572 search results - page 3459 / 3715
» High performance C
Sort
View
103
Voted
ESA
2006
Springer
96views Algorithms» more  ESA 2006»
15 years 4 months ago
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
Brian C. Dean, Michel X. Goemans, Nicole Immorlica
CODES
2001
IEEE
15 years 4 months ago
Compiler-directed selection of dynamic memory layouts
Compiler technology is becoming a key component in the design of embedded systems, mostly due to increasing participation of software in the design process. Meeting system-level ob...
Mahmut T. Kandemir, Ismail Kadayif
HYBRID
2000
Springer
15 years 4 months ago
Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods
Abstract. Sincehybridembeddedsystemsarepervasiveandoftensafetycritical, guarantees about their correct performance are desirable. The hybrid systemsmodelcheckerHyTech providessuch ...
Thomas A. Henzinger, Benjamin Horowitz, Rupak Maju...
130
Voted
JAVA
2000
Springer
15 years 4 months ago
Development routes for message passing parallelism in Java
Java is an attractive environment for writing portable message passing parallel programs. Considerable work in message passing interface bindings for the C and Fortran languages h...
J. A. Mathew, Heath A. James, Kenneth A. Hawick
98
Voted
LCPC
2000
Springer
15 years 4 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
« Prev « First page 3459 / 3715 Last » Next »