1658 search results - page 60 / 332 » Implementing Bit-addressing with Specialization |
IJCAI
2001
13 years 10 months ago
2001
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
JPDC
2006
13 years 8 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
IS
2007
13 years 8 months ago
2007
level of abstraction which is not only ideally suited for processing data on secondary storage but which also readily absorbs important issues in computational parallelism and in d...
TECS
2008
13 years 8 months ago
2008
elationships between heterogeneous models at different levels of abstraction. In particular, they can be used to represent design transformations from tightly synchronized specific...
IFIP12
2009
13 years 6 months ago
2009
In this paper the tool TELIOS is presented, for the automatic generation of a hardware machine, corresponding to a given logic program. The machine is implemented using an FPGA, wh...