1048 search results - page 112 / 210 » Framework Design for End-to-End Optimization |
122
click to vote
STOC
1995
ACM
15 years 8 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
144
click to vote
PVLDB
2010
15 years 3 months ago
2010
Large-scale data analysis lies in the core of modern enterprises and scientific research. With the emergence of cloud computing, the use of an analytical query processing infrast...
143
Voted
STOC
2005
ACM
16 years 5 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
146
click to vote
CF
2010
ACM
15 years 9 months ago
2010
ACM
Tuning applications for multi-core systems involve subtle concepts and target-dependent optimizations. New languages are being designed to express concurrency and locality without...
146
click to vote
ASE
2005
15 years 4 months ago
2005
A primary goal of program performance understanding tools is to focus the user's attention directly on optimization opportunities where significant cost savings may be found....