Sciweavers

417 search results - page 21 / 84
» Orderings for Innermost Termination
Sort
View
ICPP
1996
IEEE
13 years 11 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 months ago
Power Allocation Games in Wireless Networks of Multi-antenna Terminals
We consider wireless networks that can be modeled by multiple access channels in which all the terminals are equipped with multiple antennas. The propagation model used to account...
Elena Veronica Belmega, Samson Lasaulce, Mé...
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
14 years 2 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
14 years 2 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
GLOBECOM
2006
IEEE
14 years 1 months ago
A New Framework for Indicating Terminal Capabilities in the IP Multimedia Subsystem
The standardization of the IMS as a multi-access network implies that it can be accessed by different classes of terminals. Even at the heart of the same class of terminals (mobile...
Bassam El Saghir, Noël Crespi