1074 search results - page 129 / 215 » Parallelizing post-placement timing optimization |
IPPS
2002
IEEE
14 years 2 months ago
2002
IEEE
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
ICDCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We consider a problem that arises during the propagation of subscriptions in a contentbased publish-subscribe system. Subscription covering is a promising optimization that reduce...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
We introduce a set of techniques to both measure and optimize memory access locality of Java applications running on cc-NUMA servers. These techniques work at the object level and...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
PPSN
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...