4432 search results - page 115 / 887 » Solving Demodulation as an Optimization Problem |
131
click to vote
WWW
2008
ACM
16 years 3 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 ...
128
click to vote
PPAM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
138
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
130
click to vote
ATMOS
2010
15 years 2 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
151
click to vote
SIGMOD
2012
ACM
13 years 5 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...