6517 search results - page 118 / 1304 » On optimal service selection |
148
click to vote
GECCO
2009
Springer
16 years 27 days ago
2009
Springer
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
145
click to vote
CEC
2007
IEEE
16 years 20 days ago
2007
IEEE
Abstract— This paper provides a deep insight into the performance of genetic algorithms with reserve selection (GARS), and investigates how parameters can be regulated to solve o...
164
click to vote
GECCO
1999
Springer
15 years 10 months ago
1999
Springer
The Commonality-Based Crossover Framework has been presented as a general model for designing problem specific operators. Following this model, the Common Features/Random Sample ...
208
click to vote
AAAI
2011
14 years 6 months ago
2011
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
162
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
In a dynamic service oriented environment it is desirable for service consumers and providers to offer and obtain guarantees regarding their capabilities and requirements. WS-Agre...