Sciweavers

9119 search results - page 244 / 1824
» A Simultaneous Search Problem
Sort
View
WWW
2008
ACM
16 years 7 months ago
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
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 ...
Yunhong Zhou, Victor Naroditskiy
ICTAI
2009
IEEE
16 years 1 months ago
Enhanced Inference for the Market Split Problem
Inference in constraint programming is usually based on the deductions generated by individual constraints which are then communicated to other constraints through domain filteri...
Tarik Hadzic, Eoin O'Mahony, Barry O'Sullivan, Mei...
CEC
2007
IEEE
16 years 28 days ago
Comparing bio-inspired algorithms in constrained optimization problems
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
Efrén Mezura-Montes, Blanca Cecilia Lopez-R...
CEC
2007
IEEE
16 years 28 days ago
Continuous dynamic problem generators for evolutionary algorithms
— Addressing dynamic optimization problems has attracted a growing interest from the evolutionary algorithm community in recent years due to its importance in the applications of...
Renato Tinós, Shengxiang Yang
CP
2004
Springer
15 years 12 months ago
Quality of LP-Based Approximations for Highly Combinatorial Problems
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
Lucian Leahu, Carla P. Gomes