526 search results - page 33 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
ISMIS
1999
Springer
15 years 1 months ago
1999
Springer
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
PLDI
2003
ACM
15 years 3 months ago
2003
ACM
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...
CP
2004
Springer
15 years 3 months ago
2004
Springer
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract-- Many tracking problems are split into two subproblems, first a smooth reference trajectory is generated that meet the control design objectives, and then a closed loop c...