42 search results - page 2 / 9 » Using Lower Bounds During Dynamic BDD Minimization |
ISPD
2004
ACM
13 years 10 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
ICRA
2009
IEEE
13 years 2 months ago
2009
IEEE
Abstract-- During needle-based procedures, transitions between tissue layers often involve puncture events that produce substantial deformation and tend to drive the needle off cou...
ALGORITHMICA
2004
13 years 4 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
ICIP
2005
IEEE
14 years 6 months ago
2005
IEEE
In digital fingerprinting and multimedia forensic systems, it is possible that multiple adversaries mount attacks collectively and effectively to undermine the forensic system...