Sciweavers

1933 search results - page 80 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
112
Voted
CEC
2007
IEEE
15 years 9 months ago
How well do multi-objective evolutionary algorithms scale to large problems
Abstract— In spite of large amount of research work in multiobjective evolutionary algorithms, most have evaluated their algorithms on problems with only two to four objectives. ...
Kata Praditwong, Xin Yao
146
Voted
MOC
2002
131views more  MOC 2002»
15 years 3 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson
142
Voted
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
16 years 27 days ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
126
Voted
GECCO
2008
Springer
164views Optimization» more  GECCO 2008»
15 years 4 months ago
Genetic algorithms with local search optimization for protein structure prediction problem
This paper presents a new Genetic Algorithm for Protein Structure Prediction problem in both 2D and 3D hydrophobichydrophilic lattice models, introduced in [1]. Our algorithm evol...
Igor Berenboym, Mireille Avigal
123
Voted
COR
2008
111views more  COR 2008»
15 years 3 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song