19130 search results - page 151 / 3826 » Modelling multi-path problems |
157
click to vote
EOR
2007
15 years 6 months ago
2007
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
190
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
170
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
187
click to vote
ICA
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. This paper presents a new algorithm for solving the permutation ambiguity in convolutive blind source separation. When transformed to the frequency domain, the source sep...
158
click to vote
ISAAC
2007
Springer
16 years 18 days ago
2007
Springer
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...