356 search results - page 45 / 72 » Parallelizing time with polynomial circuits |
124
click to vote
IPCO
1998
15 years 4 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
126
click to vote
DATE
2008
IEEE
15 years 10 months ago
2008
IEEE
Sleep transistor insertion is one of today’s most promising and widely adopted solutions for controlling stand-by leakage power in nanometer circuits. Although single-cycle powe...
154
click to vote
RTSS
2006
IEEE
15 years 9 months ago
2006
IEEE
Modern FPGA devices, which include (multiple) processor core(s) as diffused IP on the silicon die, provide an excellent platform for developing custom multiprocessor systems-on-pr...
132
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
113
click to vote
ISPAN
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...