Sciweavers

1469 search results - page 122 / 294
» A New Migration Model For Distributed Genetic Algorithms
Sort
View
SPAA
1994
ACM
14 years 15 hour ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
ICIP
2010
IEEE
13 years 5 months ago
Passive imaging exploiting multiple scattering using distributed apertures
We develop a new passive image formation method capable of exploiting information about multiple scattering in the environment using measurements from a sparse array of receivers ...
Ling Wang, Il-Young Son, Birsen Yazici
PLDI
1995
ACM
13 years 11 months ago
Unifying Data and Control Transformations for Distributed Shared Memory Machines
We present a unified approach to locality optimization that employs both data and control transformations. Data transformations include changing the array layout in memory. Contr...
Michal Cierniak, Wei Li
GCC
2006
Springer
13 years 11 months ago
BSM: A scheduling algorithm for dynamic jobs based on economics theory
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu, Jianji...
INFOCOM
2006
IEEE
14 years 2 months ago
Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms
— Studying transfer opportunities between wireless devices carried by humans, we observe that the distribution of the inter-contact time, that is the time gap separating two cont...
Augustin Chaintreau, Pan Hui, Jon Crowcroft, Chris...