1547 search results - page 23 / 310 » Solving Knapsack Problems in a Sticker Based Model |
151
click to vote
ICWL
2007
Springer
16 years 15 hour ago
2007
Springer
Intelligent Tutoring Systems have made great strides in recent years. Many of these gains have been achieved for welldefined problems. However, solving ill-defined problems is imp...
145
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and d...
136
click to vote
MP
1998
15 years 5 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
175
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
177
click to vote
TNN
2010
2010
Sensitivity versus accuracy in multiclass problems using memetic Pareto evolutionary neural networks
15 years 17 days ago
This paper proposes a multiclassification algorithm using multilayer perceptron neural network models. It tries to boost two conflicting main objectives of multiclassifiers: a high...