Sciweavers

1027 search results - page 69 / 206
» Comparing Search Algorithms for the Temperature Inversion Pr...
Sort
View
ICWS
2008
IEEE
13 years 9 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
ASIAMS
2007
IEEE
14 years 2 months ago
Modified Line Search Method for Global Optimization
This paper introduces a modified version of the well known global optimization technique named line search method. The modifications refer to the way in which the direction and th...
Crina Grosan, Ajith Abraham
ESWA
2008
162views more  ESWA 2008»
13 years 8 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
BIRD
2008
Springer
177views Bioinformatics» more  BIRD 2008»
13 years 10 months ago
Fast Structured Motif Search in DNA Sequences
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
Mihail Halachev, Nematollaah Shiri
AAAI
2006
13 years 9 months ago
Estimating Search Tree Size
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
Philip Kilby, John K. Slaney, Sylvie Thiéba...