1960 search results - page 170 / 392 » The Logic of Large Enough |
TPHOL
2003
IEEE
14 years 2 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
ITC
2002
IEEE
14 years 2 months ago
2002
IEEE
—Logic optimization is the step of the very large scale integration (VLSI) design cycle where the designer performs modifications on a design to satisfy different constraints suc...
CL
2000
Springer
14 years 1 months ago
2000
Springer
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
EUROMICRO
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper addresses the problem of component selection, task assignment and task scheduling for distributed embedded computer systems. Such systems have a large number of constra...
ISMVL
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper considers an optimization method of programmable logic arrays (PLAs), which have two-input EXOR gate at the outputs. The PLA realizes an EXOR of two sum-of-products exp...