1927 search results - page 155 / 386 » UMDAs for dynamic optimization problems |
160
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
117
Voted
GECCO
2005
Springer
15 years 9 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...
94
Voted
MOR
2006
15 years 3 months ago
2006
We introduce an axiomatic definition of a conditional convex risk mapping and we derive its properties. In particular, we prove a representation theorem for conditional risk mappi...
142
Voted
TPDS
2008
15 years 3 months ago
2008
Due to the lack of stability and reliability in peer-to-peer networks, multimedia streaming over peer-to-peer networks represents several fundamental engineering challenges. First...
137
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper, we present a distributed algorithm to dynamically allocate the available resources of a service-oriented network to delay sensitive network services. We use a uti...