Sciweavers

1452 search results - page 279 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
ICS
2004
Tsinghua U.
14 years 26 days ago
Applications of storage mapping optimization to register promotion
Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop tr...
Patrick Carribault, Albert Cohen
OOPSLA
2001
Springer
13 years 12 months ago
Regression Test Selection for Java Software
Regression testing is applied to modified software to provide confidence that the changed parts behave as intended and that the unchanged parts have not been adversely affected ...
Mary Jean Harrold, James A. Jones, Tongyu Li, Dong...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
13 years 11 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
CC
2006
Springer
124views System Software» more  CC 2006»
13 years 11 months ago
Polyhedral Code Generation in the Real World
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
Nicolas Vasilache, Cédric Bastoul, Albert C...
ACMSE
2006
ACM
13 years 9 months ago
Tic-Tac-LEGO: an investigation into coordinated robotic control
The Lego Mindstorms Robot Command eXplorer (RCX) is a popular robotics kit that provides an immediate "out-of-the-box" opportunity to explore software controlled robot i...
Ruben Vuittonet, Jeff Gray