3663 search results - page 312 / 733 » Problems in the ontology of computer programs |
169
Voted
DAC
1999
ACM
16 years 7 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
189
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
176
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
In this paper we show that the problem of optimal mine planning can be cast in the framework of receding horizon control. Traditional formulations of this problem have cast it in ...
180
click to vote
JAIR
2006
15 years 6 months ago
2006
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
193
click to vote
IJHIS
2007
15 years 6 months ago
2007
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...