3758 search results - page 29 / 752 » A Complete Subsumption Algorithm |
ICWS
2003
IEEE
13 years 9 months ago
2003
IEEE
In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish value-added web services and core service by ...
ESA
1998
Springer
13 years 11 months ago
1998
Springer
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
AAAI
2006
13 years 9 months ago
2006
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...
WWW
2011
ACM
13 years 2 months ago
2011
ACM
Query auto completion is known to provide poor predictions of the user’s query when her input prefix is very short (e.g., one or two characters). In this paper we show that con...
ILP
2003
Springer
14 years 23 days ago
2003
Springer
In this paper, we investigate condensation of a clause. First, we extend a substitution graph introduced by Scheffer et al. (1996) to a total matcher graph. Then, we give a correc...