Sciweavers

10493 search results - page 195 / 2099
» Dynamic Word Problems
Sort
View
HEURISTICS
1998
252views more  HEURISTICS 1998»
13 years 8 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
AIED
2005
Springer
14 years 1 months ago
DIANE, a diagnosis system for arithmetical problem solving
We hereby describe DIANE an environment that aims at performing an automatic diagnosis on arithmetic problems depending on the productions of the learners. This work relies on resu...
Khider Hakem, Emmanuel Sander, Jean-Marc Labat, Je...
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
14 years 13 days ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
MIC
2003
116views Control Systems» more  MIC 2003»
13 years 9 months ago
On the Linear Quadratic Minimum-fuel Problem
E.I.Verriest and F.L.Lewis have presented in [1] a new method to approach the minimum-time control of linear continous-time systems avoiding the Bang-Bang control. Their method re...
H. Benazza, N. El Alami
ALGORITHMICA
2006
100views more  ALGORITHMICA 2006»
13 years 8 months ago
Error Compensation in Leaf Power Problems
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...