2542 search results - page 192 / 509 » Computing Cartograms with Optimal Complexity |
101
click to vote
SIAMJO
2000
15 years 17 days ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
113
click to vote
ICTAI
2010
IEEE
14 years 10 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
106
Voted
JSSPP
2010
Springer
14 years 10 months ago
2010
Springer
We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mech...
148
Voted
GECCO
2009
Springer
14 years 10 months ago
2009
Springer
We provide an overview of using genetic programming (GP) to model stock returns. Our models employ GP terminals (model decision variables) that are financial factors identified by...
138
click to vote
PPOPP
2011
ACM
14 years 3 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...