Stelian Ciurea

Learn More
We consider two algorithmic problems arising in the lives of Yogi Bear and Ranger Smith. The first problem is the natural algorithmic version of a classic mathematical result: any (n + 1)subset of {1, . . . , 2n} contains a pair of divisible numbers. How do we actually find such a pair? If the subset is given in the form of a bit vector, we give a RAM(More)
Developed in the mid 1970s, the technique based on genetic algorithms proved its usefulness in finding optimal or near optimal solutions to problems for which accurate solving strategies are either non-existent or require excessively long running time. We implemented a genetic algorithm to determine the parameters of a Sugeno fuzzy controller for the Truck(More)
  • 1