3379 search results - page 273 / 676 » Parallel cross-entropy optimization |
151
click to vote
ISSS
2002
IEEE
15 years 9 months ago
2002
IEEE
Software pipelining and unfolding are commonly used techniques to increase parallelism for DSP applications. However, these techniques expand the code size of the application sign...
147
click to vote
INFOCOM
1995
IEEE
15 years 7 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
130
click to vote
APPINF
2003
15 years 5 months ago
2003
Consider a parallel program with n processes and a synchronization granularity z. Consider also two multiprocessors: a multiprocessor with q processors and run-time reallocation o...
134
click to vote
AIPS
2000
15 years 5 months ago
2000
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
220
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...