Sciweavers

9849 search results - page 103 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
15 years 6 months ago
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
Andrew V. Goldberg
ANLP
1997
111views more  ANLP 1997»
15 years 5 months ago
An Improvement in the Selection Process of Machine Translation Using Inductive Learning with Genetic Algorithms
We proposed a method of machine translation using inductive learning with genetic algorithms, and confirmed the effectiveness of applying genetic algorithms. However, the system b...
Hiroshi Echizen-ya, Kenji Araki, Yoshikazu Miyanag...
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
15 years 5 months ago
A novel methodology for diversity preservation in evolutionary algorithms
In this paper we describe an improvement of an entropy-based diversity preservation approach for evolutionary algorithms. This approach exploits the information contained not only...
Giovanni Squillero, Alberto Paolo Tonda
COMGEO
2006
ACM
15 years 4 months ago
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
Simone Klenk, Volker Schmidt, Evgueni Spodarev
DAM
2006
172views more  DAM 2006»
15 years 4 months ago
A Branch-and-Cut algorithm for graph coloring
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
Isabel Méndez-Díaz, Paula Zabala