Sciweavers

6517 search results - page 202 / 1304
» On optimal service selection
Sort
View
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
14 years 10 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
ICSOC
2009
Springer
15 years 4 months ago
Transformation of Intermediate Nonfunctional Properties for Automatic Service Composition
Service-oriented computing provides an evolving paradigm for flexible and scalable applications of open systems. Web services and their automatic composition are in the mainstream...
Haruhiko Takada, Incheon Paik
EMO
2003
Springer
162views Optimization» more  EMO 2003»
16 years 12 days ago
PISA: A Platform and Programming Language Independent Interface for Search Algorithms
This paper introduces an interface specification (PISA) that allows to separate the problem-specific part of an optimizer from the problem-independent part. We propose a view of ...
Stefan Bleuler, Marco Laumanns, Lothar Thiele, Eck...
GLOBECOM
2007
IEEE
16 years 1 months ago
Relay Selection for Low-Complexity Coded Cooperation
— This paper explores relay selection and selection diversity for coded cooperation in wireless sensor networks, with complexity constraints for the sensor nodes. In previous wor...
Josephine P. K. Chu, Raviraj S. Adve, Andrew W. Ec...
CORR
2010
Springer
114views Education» more  CORR 2010»
15 years 4 months ago
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
The interplay between the mutation operator and the selection mechanism plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is stil...
Per Kristian Lehre, Xin Yao