Sciweavers

1933 search results - page 29 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
HEURISTICS
1998
252views more  HEURISTICS 1998»
13 years 8 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
ICALP
2009
Springer
14 years 9 months ago
Fast FAST
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
Noga Alon, Daniel Lokshtanov, Saket Saurabh
WWW
2009
ACM
14 years 9 months ago
Advertising keyword generation using active learning
This paper proposes an efficient relevance feedback based interactive model for keyword generation in sponsored search advertising. We formulate the ranking of relevant terms as a...
Hao Wu, Guang Qiu, Xiaofei He, Yuan Shi, Mingcheng...
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 8 months ago
An Indirect Genetic Algorithm for Set Covering Problems
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...
Uwe Aickelin
IPCO
2004
144views Optimization» more  IPCO 2004»
13 years 10 months ago
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
R. Ravi, Amitabh Sinha