Sciweavers

3758 search results - page 118 / 752
» A Complete Subsumption Algorithm
Sort
View
WWW
2007
ACM
15 years 10 months ago
On automated composition for web services
We develop a framework to compose services through discovery and orchestration for a given goal service. Tightening techniques are used in composition algorithms to achieve "...
Zhongnan Shen, Jianwen Su
UAI
2008
14 years 11 months ago
Identifying Dynamic Sequential Plans
We address the problem of identifying dynamic sequential plans in the framework of causal Bayesian networks, and show that the problem is reduced to identifying causal effects, fo...
Jin Tian
BMCBI
2008
71views more  BMCBI 2008»
14 years 10 months ago
An improved string composition method for sequence comparison
Background: Historically, two categories of computational algorithms (alignment-based and alignment-free) have been applied to sequence comparison
Guoqing Lu, Shunpu Zhang, Xiang Fang
AEI
1999
86views more  AEI 1999»
14 years 9 months ago
A factorisation model of robotic tasks
The implantation of programs which gives a robot the ability to perform a non-repetitive task (task not completely de
Salima Benbernou
AI
2007
Springer
15 years 4 months ago
Multiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
Yang Xiang, Wanling Zhang