680 search results - page 86 / 136 » Optimal spot-checking to minimize the computation time in vo... |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....
103
click to vote
ASPDAC
2004
ACM
15 years 3 months ago
2004
ACM
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
DAC
2005
ACM
14 years 11 months ago
2005
ACM
Minimizing power consumption is one of the most important objectives in IC design. Resizing gates and assigning different Vt’s are common ways to meet power and timing budgets. ...
CONEXT
2008
ACM
14 years 11 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
ICPPW
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...