15485 search results - page 294 / 3097 » Computing Optimal Subsets |
152
click to vote
VLDB
1990
ACM
15 years 10 months ago
1990
ACM
Bottom-up evaluation of deductive database programs has the advantage that it avoids repeated computation by storing all intermediate results and replacing recomputation by table ...
163
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
—A cooperative coevolutionary algorithm (CCEA) is an extension to an evolutionary algorithm (EA); it employs a divide and conquer strategy to solve an optimization problem. In it...
162
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
211
click to vote
TSP
2010
15 years 1 months ago
2010
Sparse graphical models have proven to be a flexible class of multivariate probability models for approximating high-dimensional distributions. In this paper, we propose techniques...
192
click to vote
APCSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
Dynamic optimization presents opportunities for finding run-time bottlenecks and deploying optimizations in statically compiled programs. In this paper, we discuss our current impl...