14548 search results - page 367 / 2910 » The Optimal Path-Matching Problem |
170
click to vote
DAGSTUHL
2008
15 years 8 months ago
2008
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
123
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
165
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
—Scheduling and dispatching are two ways of solving production planning problems. In this work, based on preceding works, it is explained how these two approaches can be combined...
172
click to vote
HM
2007
Springer
16 years 26 days ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
152
click to vote
GECCO
2005
Springer
16 years 7 days ago
2005
Springer
In this paper the potential of GP-generated symbolic regression for alleviating multicollinearity problems in multiple regression is presented with a case study in an industrial s...