356 search results - page 55 / 72 » Parallelizing time with polynomial circuits |
107
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
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...
130
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
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...
106
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
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 ...
152
Voted
ICAI
2010
15 years 1 months ago
2010
- 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 ...
125
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
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...