|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10 occurrences of 10 keywords
|
|
|
Results
Found 6 publication records. Showing 6 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
229 | Yunhong Zhou |
Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
87 | Alexander E. Mohr |
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem. |
DCC |
2002 |
DBLP DOI BibTeX RDF |
multiple choice knapsack problem, MCKP, data compression, NP-complete, NP-hard, quantization, knapsack problem, bit allocation, rate-distortion optimization |
51 | Yunhong Zhou, Victor Naroditskiy |
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding. |
WWW |
2008 |
DBLP DOI BibTeX RDF |
keyword bidding, multiple-choice knapsack problem, sponsored search auction, stochastic optimization |
46 | I-Wei Lai, Chia-Han Lee, Gerd Ascheid, Tzi-Dar Chiueh |
Channel-Adaptive MIMO Detection Based on the Multiple-Choice Knapsack Problem (MCKP). |
IEEE Wirel. Commun. Lett. |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Tao Yu, Kwei-Jay Lin |
Service selection algorithms for Web services with end-to-end QoS constraints. |
Inf. Syst. E Bus. Manag. |
2005 |
DBLP DOI BibTeX RDF |
QoS broker, Service compostion, End-to-end constraint, Web service, Service selection |
25 | Tao Yu, Kwei-Jay Lin |
Service Selection Algorithms for Web Services with End-to-End QoS Constraints. |
CEC |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #6 of 6 (100 per page; Change: )
|
|