4037 search results - page 281 / 808 » Routing without ordering |
133
click to vote
HASKELL
2007
ACM
15 years 4 months ago
2007
ACM
This paper describes the design and construction of a Haskell source-level debugger built into the GHCi interactive environment. We have taken a pragmatic approach: the debugger i...
89
Voted
ASPDAC
2005
ACM
15 years 2 months ago
2005
ACM
Incremental physical design is an important methodology towards achieving design closure for high-performance large-scale circuits. Placement tools must accommodate incremental ch...
92
Voted
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
: Let (C1, C1), (C2, C2), . . . , (Cm, Cm) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with repetition) from the set of all 4 n 2 clauses on n variab...
117
Voted
ACL
1998
15 years 2 months ago
1998
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
110
click to vote
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
We present a method to remove partial occlusion that arises from out-of-focus thin foreground occluders such as wires, branches, or a fence. Such partial occlusion causes the irra...