10901 search results - page 444 / 2181 » Approximations in Distributed Optimization |
201
click to vote
GECCO
2005
Springer
16 years 1 months ago
2005
Springer
The Internet is different from traditional parallel computing environments, and Distributed Genetic Algorithms (DGAs) for the Internet need to be designed to address these diffe...
207
click to vote
PLDI
1995
ACM
1995
ACM
Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
15 years 11 months ago
Partial Redundancy Elimination PRE is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redun...
170
click to vote
PE
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we consider a discrete-time finite-buffer queue with correlated arrivals and service interruptions and the corresponding infinite-buffer queue. Under some assumptio...
204
click to vote
ISAAC
2004
Springer
16 years 1 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
213
click to vote
AIIA
2009
Springer
16 years 9 days ago
2009
Springer
In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with differe...