Sciweavers

336 search results - page 4 / 68
» Permutation Problems and Channelling Constraints
Sort
View
CSR
2006
Springer
13 years 11 months ago
The Complexity of Equality Constraint Languages
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
Manuel Bodirsky, Jan Kára
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
13 years 11 months ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro
ECAI
2008
Springer
13 years 9 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson
CISS
2008
IEEE
14 years 1 months ago
Resource allocation algorithms for multiuser cooperative OFDMA systems with subchannel permutation
— In this paper, we investigate resource allocation for a multi-user OFDMA cooperative system. Aiming at minimizing the total transmission power under target rate constraints for...
Bo Gui, Leonard J. Cimini Jr.