CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 30.
64. lappuse
... minimal . We then use the max function to create all on - set minterms from the set of minimal minterms where max and minimal are defined as follows . Definition 1 A max of a set of minterms is the bit - wise OR of the binary ...
... minimal . We then use the max function to create all on - set minterms from the set of minimal minterms where max and minimal are defined as follows . Definition 1 A max of a set of minterms is the bit - wise OR of the binary ...
65. lappuse
minimal minterm can be composed of subsets of positive literals from different existing minterms as shown in i ) . primary variables asserted true current minimal solution current non - minimal solution a ) first solution b ) non - minimal ...
minimal minterm can be composed of subsets of positive literals from different existing minterms as shown in i ) . primary variables asserted true current minimal solution current non - minimal solution a ) first solution b ) non - minimal ...
68. lappuse
... minimal minterm in set theory is the computation of a minimal . The minimal of a subset of an ordered set is an element such that no other element that is less than the minimal is in the subset . If we think of a minterm as a ...
... minimal minterm in set theory is the computation of a minimal . The minimal of a subset of an ordered set is an element such that no other element that is less than the minimal is in the subset . If we think of a minterm as a ...
Saturs
Keynote | 3 |
A Core Flight Software System | 13 |
A CycleAccurate Compilation Algorithm for Custom Pipelined Datapaths | 21 |
Autortiesības | |
31 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
abstraction algorithm allocation analysis application approach architecture benchmarks binary biochips buffer byte cache channel chip circuit clock communication compiler components compression Computer configuration constraints copies coprocessor core CRAMES cycle cycle accurate simulation data block decoder digital microfluidic DVFS dynamic Echo instructions EEMBC efficient embedded systems energy consumption execution FPGA function graph hardware hash IEEE implementation input instruction-set interface iteration latency loop mapping marked graph memory accesses methodology microblaze microfluidic minimal minterms minterms module multiplier multiprocessor node on-chip operations optimal output overhead packet parallel parameters partition performance pipeline platform port power consumption Proc processor proposed reconfigurable reduce resource router runtime samples scheduling SECTAG Section SELinux simulation space specific speedup switch synchronization synthesis SystemC Table target task techniques tion transaction universal hash functions vector VLIW voltage WCET Xilinx