Sciweavers

5329 search results - page 586 / 1066
» The Weighted Majority Algorithm
Sort
View
AAAI
2006
15 years 8 months ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
EUMAS
2006
15 years 8 months ago
Near-Optimal Anytime Coalition Structure Generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...
WSCG
2004
156views more  WSCG 2004»
15 years 8 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...
CEC
2010
IEEE
15 years 8 months ago
Adaptive learning particle swarm optimizer-II for global optimization
This paper presents an updated version of the adaptive learning particle swarm optimizer (ALPSO) [6], we call it ALPSO-II. In order to improve the performance of ALPSO on multi-mod...
Changhe Li, Shengxiang Yang
268
Voted
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
15 years 8 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder