Sciweavers

4526 search results - page 88 / 906
» Algorithmic problems related to the Internet
Sort
View
153
Voted
SEMWEB
2010
Springer
15 years 1 months ago
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet
ICWS
2008
IEEE
15 years 5 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
PKDD
2010
Springer
122views Data Mining» more  PKDD 2010»
15 years 2 months ago
Exploration in Relational Worlds
Abstract. One of the key problems in model-based reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large relational domains, in wh...
Tobias Lang, Marc Toussaint, Kristian Kersting
ICDM
2005
IEEE
129views Data Mining» more  ICDM 2005»
15 years 9 months ago
Mining Chains of Relations
Traditional data mining applications consider the problem of mining a single relation between two attributes. For example, in a scientific bibliography database, authors are rela...
Foto N. Afrati, Gautam Das, Aristides Gionis, Heik...
141
Voted
IJCAI
1989
15 years 5 months ago
Approximation Algorithms for Temporal Reasoning
We consider a representation for temporal relations between intervals introduced by James Allen, and its associated computational or reasoning problem: given possibly indefinite ...
Peter van Beek