Sciweavers

142 search results - page 20 / 29
» A Constant Propagation Algorithm for Explicitly Parallel Pro...
Sort
View
89
Voted
ICDCS
2003
IEEE
15 years 5 months ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande
DCOSS
2006
Springer
15 years 3 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
97
Voted
SPAA
2005
ACM
15 years 5 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
93
Voted
CGO
2010
IEEE
15 years 6 months ago
Parameterized tiling revisited
Tiling, a key transformation for optimizing programs, has been widely studied in literature. Parameterized tiled code is important for auto-tuning systems since they often execute...
Muthu Manikandan Baskaran, Albert Hartono, Sanket ...
CC
2010
Springer
135views System Software» more  CC 2010»
14 years 11 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner