1480 search results - page 141 / 296 » Ants can solve constraint satisfaction problems |
170
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
175
click to vote
WEBI
2007
Springer
16 years 18 days ago
2007
Springer
Nonnegative Matrix Factorization (NMF) has been proven to be effective in text mining. However, since NMF is a well-known unsupervised components analysis technique, the existing ...
177
click to vote
IOR
2006
15 years 6 months ago
2006
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
220
click to vote
CPAIOR
2011
Springer
14 years 10 months ago
2011
Springer
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...
178
click to vote
IOR
2006
15 years 6 months ago
2006
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...