2109 search results - page 124 / 422 » Solving Necklace Constraint Problems |
132
click to vote
ISAAC
1992
Springer
15 years 9 months ago
1992
Springer
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
149
click to vote
APIN
2005
15 years 5 months ago
2005
A hybrid Neural-Genetic algorithm (NG) is presented for the frequency assignment problem in satellite communications (FAPSC). The goal of this problem is minimizing the cochannel i...
174
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
125
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
143
click to vote
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract--Current multibeam satellite systems perform centralized power and carrier allocation assuming a Multi-Frequency Time Division Multiple Access (MF-TDMA) scheme with fixed ...