2925 search results - page 158 / 585 » Information Complexity of Online Problems |
174
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
189
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
183
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
192
click to vote
CSB
2005
IEEE
16 years 3 days ago
2005
IEEE
Scientists face an ever-increasing challenge in investigating biological systems with high throughput experimental methods such as mass spectrometry and gene arrays because of the...
148
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Finding the core members of a virtual community is an important problem in community analysis. Here we presented an simulated annealing algorithm to solve this problem by optimizi...