6456 search results - page 420 / 1292 » Constraint Solving on Terms |
190
Voted
CADE
2010
Springer
15 years 5 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
206
Voted
WWW
2009
ACM
16 years 7 months ago
2009
ACM
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
203
click to vote
ATAL
2003
Springer
16 years 3 days ago
2003
Springer
Agents collaborating on a set of tasks subject to temporal constraints must coordinate their activities to ensure that all of the temporal constraints are ultimately satisfied. S...
199
click to vote
DEXAW
1999
IEEE
15 years 11 months ago
1999
IEEE
With the growing significance of digital libraries and the Internet, more and more electronic texts become accessible to a wide and geographically disperse public. This requires a...
194
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
We investigate self-testing programs with relative error by allowing error terms proportional to the function to be computed. Until now, in numerical computation, error terms were ...