Sciweavers

356 search results - page 55 / 72
» Parallelizing time with polynomial circuits
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
PODC
2010
ACM
13 years 11 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
DAGSTUHL
2006
13 years 9 months ago
Decentralization and Mechanism Design for Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
ICAI
2010
13 years 5 months ago
Constraint-Based Dogleg Channel Routing with Via Minimization
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
I-Lun Tseng, Huan-Wen Chen, Che-I Lee, Adam Postul...
DAC
2006
ACM
14 years 9 months ago
Stochastic variational analysis of large power grids considering intra-die correlations
For statistical timing and power analysis that are very important problems in the sub-100nm technologies, stochastic analysis of power grids that characterizes the voltage fluctua...
Praveen Ghanta, Sarma B. K. Vrudhula, Sarvesh Bhar...