708 search results - page 17 / 142 » Timing closure: the solution and its problems |
162
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we deal with arbitrary convex and concave rectilinear module packing using the Transitive Closure Graph (TCG) representation. The geometric meanings of modules are ...
MEMOCODE
2006
IEEE
15 years 3 months ago
2006
IEEE
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
AAAI
2000
14 years 11 months ago
2000
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...