696 search results - page 68 / 140 » A class of combinatorial identities |
188
click to vote
ECAI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
178
click to vote
ISER
2000
Springer
15 years 10 months ago
2000
Springer
: This paper addresses motion planning of a homogeneous modular robotic system. The modules have self-reconfiguration capability so that a group of the modules can construct a robo...
164
click to vote
AAAI
2007
15 years 8 months ago
2007
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
162
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
158
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...