Sciweavers

1933 search results - page 30 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
14 years 23 days ago
Improved Approximations of Independent Sets in Bounded-Degree Graphs
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
Magnús M. Halldórsson, Jaikumar Radh...
SIGIR
2006
ACM
14 years 2 months ago
Improving web search ranking by incorporating user behavior information
We show that incorporating user behavior data can significantly improve ordering of top results in real web search setting. We examine alternatives for incorporating feedback into...
Eugene Agichtein, Eric Brill, Susan T. Dumais
GECCO
2009
Springer
126views Optimization» more  GECCO 2009»
14 years 1 months ago
Improving NSGA-II with an adaptive mutation operator
The performance of a Multiobjective Evolutionary Algorithm (MOEA) is crucially dependent on the parameter setting of the operators. The most desired control of such parameters pre...
Arthur Gonçalves Carvalho, Aluizio F. R. Ar...
AAIM
2009
Springer
137views Algorithms» more  AAIM 2009»
14 years 3 months ago
On Approximating an Implicit Cover Problem in Biology
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Ar...
FCT
1993
Springer
14 years 24 days ago
Generalized Topological Sorting in Linear Time
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
Torben Hagerup, Martin Maas