3142 search results - page 28 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
IR
2002
14 years 9 months ago
2002
This paper presents the design and evaluation of a text categorization method based on the Hierarchical Mixture of Experts model. This model uses a divide and conquer principle to ...
COR
2008
14 years 9 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
116
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
COMPUTING
2006
14 years 9 months ago
2006
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
This paper attempts to extend the XCS research by analyzing the impact of information exchange between XCS agents on classifier performance. Two types of information are exchange...