2899 search results - page 18 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
106
click to vote
DEXA
2003
Springer
15 years 6 months ago
2003
Springer
Query optimizers in current database management systems (DBMS) often face problems such as intolerably long optimization time and/or poor optimization results when optimizing compl...
CP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. In this paper we consider the problem of optimal task allocation and scheduling in embedded real-time systems. This problem is far from trivial due to the wide range of c...
110
click to vote
AUTOMATICA
2008
15 years 1 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
116
click to vote
COCO
1995
Springer
15 years 4 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
137
click to vote
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— In this paper, we propose a resource allocation algorithm for ergodic weighted-sum rate maximization in downlink OFDMA systems. In contrast to most previous research tha...