Sciweavers

6517 search results - page 106 / 1304
» On optimal service selection
Sort
View
COMPLEXITY
2004
108views more  COMPLEXITY 2004»
15 years 6 months ago
On the convergence of a factorized distribution algorithm with truncation selection
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
Qingfu Zhang
CN
1998
64views more  CN 1998»
15 years 6 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
ICML
2009
IEEE
16 years 7 months ago
Optimized expected information gain for nonlinear dynamical systems
This paper addresses the problem of active model selection for nonlinear dynamical systems. We propose a novel learning approach that selects the most informative subset of time-d...
Alberto Giovanni Busetto, Cheng Soon Ong, Joachim ...
GECCO
2005
Springer
147views Optimization» more  GECCO 2005»
15 years 11 months ago
Unbiased tournament selection
Tournament selection is a popular form of selection which is commonly used with genetic algorithms, genetic programming and evolutionary programming. However, tournament selection...
Artem Sokolov, Darrell Whitley
APSEC
2005
IEEE
15 years 12 months ago
Model-Driven Semantic Web Service Composition
As the number of available Web services increases there is a growing demand to realise complex business processes by combining and reusing available Web services. The reuse and co...
Roy Grønmo, Michael C. Jaeger