16596 search results - page 360 / 3320 » Generalized Assignment Problems |
194
click to vote
EVOW
2004
Springer
16 years 24 days ago
2004
Springer
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
179
click to vote
ISCAS
2002
IEEE
16 years 10 days ago
2002
IEEE
We address the problem of checking the routability of segmented channels using satisfiability. The segmented channel routing problem arises in the context of row-based field progr...
246
click to vote
PACT
1999
Springer
15 years 11 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
198
click to vote
COCOON
2008
Springer
15 years 9 months ago
2008
Springer
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
154
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...