1960 search results - page 251 / 392 » The Logic of Large Enough |
CADE
2003
Springer
14 years 10 months ago
2003
Springer
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
ESOP
2010
Springer
14 years 7 months ago
2010
Springer
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
ICCAD
2007
IEEE
14 years 7 months ago
2007
IEEE
An algorithm for technology mapping of combinational and sequential logic networks is proposed and applied to mapping into K-input lookup-tables (K-LUTs). The new algorithm avoids...
ICCAD
2001
IEEE
14 years 7 months ago
2001
IEEE
Redundancy-addition-and-removal is a rewiring technique which for a given target wire wt finds a redundant alternative wire wa. Addition of wa makes wt redundant and hence removab...
HICSS
2009
IEEE
14 years 5 months ago
2009
IEEE
The requirement for power system operators to respond more efficiently to the stressed power system conditions that may create large number of alarms asks fort advanced alarm proc...