883 search results - page 77 / 177 » A Genetic Algorithm Applied to the Maximum Flow Problem |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
IJIT
2004
13 years 9 months ago
2004
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
AICCSA
2006
IEEE
14 years 1 months ago
2006
IEEE
Multi-class problem is the class of problems having more than one classes in the data set. Bayesian Network (BN) is a well-known algorithm handling the multi-class problem and is ...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...