Sciweavers

1578 search results - page 133 / 316
» Algorithmic randomness of continuous functions
Sort
View
ICGA
1993
296views Optimization» more  ICGA 1993»
15 years 3 months ago
A Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
Toshinori Munakata, David J. Hashier
ICST
2010
IEEE
15 years 25 days ago
Repairing GUI Test Suites Using a Genetic Algorithm
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
Si Huang, Myra B. Cohen, Atif M. Memon
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 8 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
MP
1998
109views more  MP 1998»
15 years 2 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
GLOBECOM
2008
IEEE
15 years 8 months ago
Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
Kostas Christodoulopoulos, Konstantinos Manousakis...