Sciweavers

429 search results - page 26 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
15 years 4 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
Christoph Dürr, Flavio Guiñez, Mart&ia...
ISAAC
2009
Springer
121views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Generalized Reduction to Compute Toric Ideals
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
Deepanjan Kesh, Shashank K. Mehta
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
15 years 4 months ago
Global multiobjective optimization via estimation of distribution algorithm with biased initialization and crossover
Multiobjective optimization problems with many local Pareto fronts is a big challenge to evolutionary algorithms. In this paper, two operators, biased initialization and biased cr...
Aimin Zhou, Qingfu Zhang, Yaochu Jin, Bernhard Sen...
STACS
2010
Springer
15 years 4 months ago
Log-space Algorithms for Paths and Matchings in k-trees
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
DNIS
2005
Springer
102views Database» more  DNIS 2005»
15 years 3 months ago
An Improved Approach to Extract Document Summaries Based on Popularity
With the rapid growth of the Internet, most of the textual data in the form of newspapers, magazines and journals tend to be available on-line. Summarizing these texts can aid the...
P. Arun Kumar, K. Praveen Kumar, T. Someswara Rao,...