Sciweavers

1960 search results - page 159 / 392
» The Logic of Large Enough
Sort
View
JAPLL
2007
135views more  JAPLL 2007»
13 years 9 months ago
Open answer set programming for the semantic web
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
ET
2000
80views more  ET 2000»
13 years 9 months ago
A New Method for Testing Re-Programmable PLAs
: We present a method for obtaining a minimal set of test configurations and their associated set oftest patterns that completely tests re-programmable Programmable Logic Arrays (P...
Charles E. Stroud, James R. Bailey, Johan R. Emmer...
AEI
1999
120views more  AEI 1999»
13 years 9 months ago
Genetic algorithms for designing multihop lightwave network topologies
Multihop lightwave networks are a means of utilizing the large bandwidth of optical fibers. In these networks, each node has a fixed number of transmitters and receivers connected...
Cenk Gazen, Cem Ersoy
ISLPED
2003
ACM
86views Hardware» more  ISLPED 2003»
14 years 2 months ago
Exploiting compiler-generated schedules for energy savings in high-performance processors
This paper develops a technique that uniquely combines the advantages of static scheduling and dynamic scheduling to reduce the energy consumed in modern superscalar processors wi...
Madhavi Gopal Valluri, Lizy Kurian John, Heather H...
VLSID
2002
IEEE
100views VLSI» more  VLSID 2002»
14 years 2 months ago
Layout-Driven Timing Optimization by Generalized De Morgan Transform
We propose a timing-oriented logic optimization technique called Generalized De Morgan (GDM) transform, that integrates gate resizing, net buffering and De Morgan transformation. ...
Supratik Chakraborty, Rajeev Murgai