729 search results - page 106 / 146 » Solving subgraph isomorphism problems with constraint progra... |
123
click to vote
LPNMR
2007
Springer
15 years 10 months ago
2007
Springer
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
186
click to vote
BMCBI
2011
14 years 11 months ago
2011
Background: It is difficult to accurately interpret chromosomal correspondences such as true orthology and paralogy due to significant divergence of genomes from a common ancestor...
137
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
We present an efficient optimization scheme for gate sizing in the presence of process variations. Using a posynomial delay model, the delay constraints are modified to incorporat...
110
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
153
click to vote
TCAD
2008
15 years 3 months ago
2008
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...