8486 search results - page 1 / 1698 » Ordered Enumeration Method |
CSC
2006
13 years 6 months ago
2006
ICFCA
2010
Springer
14 years 3 days ago
2010
Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
ASPDAC
2007
ACM
13 years 9 months ago
2007
ACM
While the covering algorithm has been perfected recently by the iterative approaches, such as DAOmap and IMap, its application has been limited to technology mapping. The main fact...
ASAP
2008
IEEE
13 years 7 months ago
2008
IEEE
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...
LCPC
2000
Springer
13 years 8 months ago
2000
Springer
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...