2007 29th International Conference on Information…

2007

This paper addresses the way in which heuristic algorithms can be used to solve the n-queen problem. Metaheuristics for algorithm simulated annealing, tabu search and genetic algorithm are shown,… (More)

This paper addresses the comparison of heuristic algorithms in the case of real functions optimization and knapsack problem. Metaheuristics for algorithms hill climbing, simulated annealing, tabu… (More)

We give a series of recursive identities for the number of partitions with exactly k parts and with constraints on both the minimal difference among the parts and the minimal part. Using these… (More)

This paper presents a way of using the natural evolution process as a model for combinatorial design constructions. In spite of the fact that metaheuristic proved its efficiency on a variety of… (More)

This paper introduces a way of constructing biplanes that uses “filters” in a step prior to an exhaustive computer search, with the objective to make the biplane construction more efficient. The… (More)

In this paper we present a new class of integer partition identities. The number of partitions with d-distant parts can be written as a sum of the numbers of partitions of various lengths with… (More)