562 search results - page 30 / 113 » Dependency Pairs Revisited |
ASPDAC
2004
ACM
15 years 5 months ago
2004
ACM
Non-rectangular (rectilinear) shape occurs very often in deep submicron floorplanning. Most previous algorithms are designed to handle only convex rectilinear blocks. However, han...
128
click to vote
RTA
2004
Springer
15 years 7 months ago
2004
Springer
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
111
click to vote
IANDC
2007
15 years 1 months ago
2007
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
115
click to vote
CICLING
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. The development of a syntactic textual entailment system that compares the dependency relations in both the text and the hypothesis has been reported. The Stanford Depend...
140
click to vote
IJCAI
2007
15 years 3 months ago
2007
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov ne...