989 search results - page 92 / 198 » Dynamic Time Step Control Algorithm Enhancements |
101
click to vote
NOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
Dynamic routing can substantially enhance the quality of service for multiprocessor communication, and can provide intelligent adaptation of faulty links during run time. Implemen...
128
Voted
WWW
2007
ACM
16 years 3 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
131
Voted
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
147
Voted
ANTSW
2008
Springer
15 years 4 months ago
2008
Springer
An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perfor...
103
Voted
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
—We propose a reduced-complexity genetic algorithm for dynamic deployment of resource constrained multi-hop mobile sensor networks. The goal of this paper is to achieve optimal c...