468 search results - page 69 / 94 » Computationally Feasible Automated Mechanism Design: General... |
DAC
2008
ACM
14 years 9 months ago
2008
ACM
Embedded systems with heterogeneous processors extend the energy/timing trade-off flexibility and provide the opportunity to fine tune resource utilization for particular applicat...
DAC
2004
ACM
14 years 9 months ago
2004
ACM
Current Static Timing Analysis (STA) techniques allow one to verify the timing of a circuit at different process corners which only consider cases where all the supplies are low o...
DAC
2005
ACM
14 years 9 months ago
2005
ACM
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
CGF
2004
13 years 8 months ago
2004
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
RECOMB
1997
Springer
14 years 16 days ago
1997
Springer
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...