2899 search results - page 190 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
193
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
180
click to vote
HM
2007
Springer
16 years 22 days ago
2007
Springer
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
164
click to vote
DT
2000
15 years 6 months ago
2000
The design of complex embedded systems involves the simultaneous optimization of several often competing objectives. Instead of a single optimal design, there is rather a set of a...
195
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
159
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...