540 search results - page 85 / 108 » Mathematical programming based debugging |
COR
2008
13 years 7 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
COR
2008
13 years 7 months ago
2008
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
ENTCS
2008
13 years 7 months ago
2008
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
CSJM
2006
13 years 7 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
TSMC
2008
13 years 7 months ago
2008
Abstract--This paper traces the development of neuralnetwork (NN)-based feedback controllers that are derived from the principle of adaptive/approximate dynamic programming (ADP) a...