2845 search results - page 445 / 569 » Constraints over Ontologies |
VLSID
1999
IEEE
14 years 1 months ago
1999
IEEE
Recently Lillis, et al. presented an elegant dynamic programming approach to RC interconnect delay optimization through driver sizing, repeater insertion, and, wire sizing which e...
VLSID
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper we address the problem of detailed FPGA routing using Boolean formulation methods. In the context of FPGA routing where routing resources are fixed, Boolean formulat...
AGP
1998
IEEE
14 years 1 months ago
1998
IEEE
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...
ICCL
1998
IEEE
14 years 1 months ago
1998
IEEE
An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements...
ISCA
1998
IEEE
14 years 1 months ago
1998
IEEE
Indirect branch prediction is likely to become increasingly important in the future because indirect branches occur more frequently in object-oriented programs. With misprediction ...