1165 search results - page 130 / 233 » Effective linear programming based placement methods |
174
click to vote
FATES
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. More and more software systems use a browser as the universal graphical user interface. As a consequence these applications inherit browser navigation as part of their in...
224
click to vote
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Scheduling/prioritization of DBMS transactions is important for many applications that rely on database backends. A convenient way to achieve scheduling is to limit the number of ...
128
click to vote
GPEM
2008
15 years 3 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
160
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
226
Voted
ISCA
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...