Learn More
The effectiveness of combinatorial search heuristics, such as Genetic Algorithms (GA), is limited by their ability to balance the need for a diverse set of sampling points with the desire to quickly focus search upon potential solutions. One of the methods often used to address this problem is to simulate the theory of punctuated equilibria in the GA. The(More)
Influenced by rapid interests in the area of language generation, in the present attempt, we have employed various generation and disambiguation rules for generating questions from simple as well as complex sentences. In addition to building a question generation system along with pre and post processing modules, we have also developed and integrated a(More)
The effectiveness of combinatorial search heuristics, such as Genetic Algorithms (GA), is limited by their ability to balance the need for a diverse set of sampling points with the desire to quickly focus search upon potential solutions. One of the methods often used to address this problem is to simulate the theory of punctuated equilibria in the GA. The(More)
The effectiveness of combinatorial search heuristics, such as Genetic Algorithms (GA), is limited by their ability to balance the need for a diverse set of sampling points with the desire to quickly focus search upon potential solutions. One of the methods often used to address this problem is to simulate the theory of punctuated equilibria in the GA. The(More)
The effectiveness of combinatorial search heuristics, such as Genetic Algorithms (GA), is limited by their ability to balance the need for a diverse set of sampling points with the desire to quickly focus search upon potential solutions. One of the methods often used to address this problem is to simulate the theory of punctuated equilibria in the GA. The(More)
  • 1