1007 search results - page 108 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
138
Voted
ICPP
1993
IEEE
15 years 6 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
132
Voted
CCO
2001
Springer
15 years 7 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
227
Voted
ICDT
2011
ACM
14 years 6 months ago
2011
ACM
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
195
click to vote
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
111
Voted
ICCAD
2001
IEEE
15 years 11 months ago
2001
IEEE
Efficient high level design tools that can map behavioral descriptions to FPGA architectures are one of the key requirements to fully leverage FPGA for high throughput computatio...