6004 search results - page 603 / 1201 » Parallelizing query optimization |
177
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
191
click to vote
ISSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Software pipelining and unfolding are commonly used techniques to increase parallelism for DSP applications. However, these techniques expand the code size of the application sign...
180
click to vote
INFOCOM
1995
IEEE
15 years 10 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
161
click to vote
APPINF
2003
15 years 7 months ago
2003
Consider a parallel program with n processes and a synchronization granularity z. Consider also two multiprocessors: a multiprocessor with q processors and run-time reallocation o...
163
click to vote
AIPS
2000
15 years 7 months ago
2000
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...