Sciweavers

883 search results - page 23 / 177
» A Genetic Algorithm Applied to the Maximum Flow Problem
Sort
View
EVOW
1999
Springer
13 years 11 months ago
Approximate Equivalence Verification for Protocol Interface Implementation via Genetic Algorithms
This paper describes a new approximate approach for checking the correctness of the implementation of a protocol interface, comparing its lowlevel implementation with its high-leve...
Fulvio Corno, Matteo Sonza Reorda, Giovanni Squill...
GECCO
2004
Springer
109views Optimization» more  GECCO 2004»
14 years 27 days ago
Tackling an Inverse Problem from the Petroleum Industry with a Genetic Algorithm for Sampling
Abstract. When direct measurement of model parameters is not possible, these need to be inferred indirectly from calibration data. To solve this inverse problem, an algorithm that ...
Pedro J. Ballester, Jonathan N. Carter
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
13 years 11 months ago
Solving identification problem for asynchronous finite state machines using genetic algorithms
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...
Xiaojun Geng
ICTAC
2005
Springer
14 years 1 months ago
Maximum Marking Problems with Accumulative Weight Functions
We present a new derivation of eļ¬ƒcient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the speciļ...
Isao Sasano, Mizuhito Ogawa, Zhenjiang Hu
SIAMDM
2000
159views more  SIAMDM 2000»
13 years 7 months ago
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
Lisa Fleischer