1927 search results - page 149 / 386 » UMDAs for dynamic optimization problems |
113
Voted
AUSAI
2005
Springer
15 years 6 months ago
2005
Springer
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
108
Voted
TSMC
2010
14 years 7 months ago
2010
In this paper, we present two near-optimal methods to determine the real-time collision-free path for a mobile vehicle moving in a dynamically changing environment. The proposed de...
139
Voted
ICS
1993
Tsinghua U.
15 years 5 months ago
1993
Tsinghua U.
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
119
Voted
ISPD
2004
ACM
15 years 6 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
122
Voted
ICIP
2004
IEEE
16 years 2 months ago
2004
IEEE
In this paper, we propose an optimal unequal error protection scheme for object-based video communications over differentiated services networks. Our goal is to achieve the best v...