3381 search results - page 65 / 677 » Extending Dependencies with Conditions |
158
click to vote
STRINGOLOGY
2004
15 years 7 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
136
click to vote
XSYM
2005
Springer
15 years 11 months ago
2005
Springer
Recently, the issue of functional dependencies in XML (XFDs) have been investigated. In this paper we consider the problem of checking the satisfaction of an XFD in an XML document...
154
click to vote
RTA
2004
Springer
15 years 11 months ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
142
click to vote
AIPS
2009
15 years 7 months ago
2009
Recently, Helmert and Geffner proposed the context-enhanced additive heuristic, where fact costs are evaluated relative to context states that arise from achieving first a pivot c...
190
click to vote
AIPS
2009
15 years 7 months ago
2009
In this paper we extend dynamic controllability of temporally-flexible plans to temporally-flexible reactive programs. We consider three reactive programming language constructs w...