Sciweavers

1566 search results - page 38 / 314
» On a Cone Covering Problem
Sort
View
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
15 years 11 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 5 months ago
Sufficient Second-Order Optimality Conditions for Semilinear Control Problems with Pointwise State Constraints
Second-order sufficient optimality conditions are established for the optimal control of semilinear elliptic and parabolic equations with pointwise constraints on the control and t...
Eduardo Casas, Juan Carlos de los Reyes, Fredi Tr&...
MOR
2007
116views more  MOR 2007»
15 years 5 months ago
Complex Matrix Decomposition and Quadratic Programming
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over sp...
Yongwei Huang, Shuzhong Zhang
ICDCS
2007
IEEE
16 years 9 days ago
Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves
We consider a problem that arises during the propagation of subscriptions in a contentbased publish-subscribe system. Subscription covering is a promising optimization that reduce...
Zhenhui Shen, Srikanta Tirthapura
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
15 years 11 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey