Sciweavers

1026 search results - page 111 / 206
» An Optimal Solution to Room Search Problem
Sort
View
IMCSIT
2010
15 years 4 months ago
ACO with semi-random start applied on MKP
Ant Colony Optimization (ACO) is a stochastic search method that mimics the social behavior of real ants colonies, which manage to establish the shortest route to feeding sources a...
Stefka Fidanova, Pencho Marinov, Krassimir T. Atan...
CEC
2007
IEEE
16 years 21 days ago
Target shape design optimization by evolving splines
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
15 years 12 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
CIKM
2009
Springer
16 years 28 days ago
A general magnitude-preserving boosting algorithm for search ranking
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 11 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom