Sciweavers

1452 search results - page 55 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
ICC
2007
IEEE
122views Communications» more  ICC 2007»
14 years 4 months ago
Dynamic Programming for Scheduling a Single Route in Wireless Networks
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
Gyouhwan Kim, Rohit Negi
AOSD
2008
ACM
13 years 12 months ago
Tool-supported refactoring of aspect-oriented programs
Aspect-oriented programming languages provide new composition mechanisms for improving the modularity of crosscutting concerns. Implementations of such language support use advanc...
Jan Wloka, Robert Hirschfeld, Joachim Hänsel
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
14 years 2 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
ENGL
2007
191views more  ENGL 2007»
13 years 10 months ago
Application of Genetic Algorithm to the Optimization of Gain of Magnetized Ferrite Microstrip Antenna
The application of Genetic Algorithm (GA) to the optimization of gain of microstrip antenna, fabricated on ferrite substrate, biased externally by a steady magnetic field, is repor...
Neela Chattoraj, Jibendu Sekhar Roy
IEEEPACT
2009
IEEE
14 years 4 months ago
Interprocedural Load Elimination for Dynamic Optimization of Parallel Programs
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
Rajkishore Barik, Vivek Sarkar