Sciweavers

419 search results - page 59 / 84
» First Order Paths in Ordered Trees
Sort
View
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
13 years 7 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
CADE
1998
Springer
14 years 2 months ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
CSL
2010
Springer
13 years 11 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel
ORDER
2006
97views more  ORDER 2006»
13 years 9 months ago
Upward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
Vida Dujmovic, David R. Wood
WWW
2005
ACM
14 years 10 months ago
Online curriculum on the semantic Web: the CSD-UoC portal for peer-to-peer e-learning
Online Curriculum Portals aim to support networks of instructors and learners by providing a space of convergence for enhancing peer-to-peer learning interactions among individual...
Dimitris Kotzinos, Sofia Pediaditaki, Apostolos Ap...