Sciweavers

1484 search results - page 153 / 297
» Ants meeting algorithms
Sort
View
76
Voted
CDC
2010
IEEE
14 years 5 months ago
Vision-based cooperative estimation via multi-agent optimization
Abstract-- In this paper, we investigate a cooperative estimation problem for visual sensor networks based on multiagent optimization techniques. A passivity-based visual motion ob...
Takeshi Hatanaka, Masayuki Fujita, Francesco Bullo
82
Voted
CORR
2011
Springer
239views Education» more  CORR 2011»
14 years 1 months ago
Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
Imen Harbaoui Dridi, Ryan Kammarti, Pierre Borne, ...
79
Voted
INFOCOM
2011
IEEE
14 years 1 months ago
Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
Michael J. Neely, Leana Golubchik
96
Voted
SIGIR
2011
ACM
14 years 29 days ago
Decayed DivRank: capturing relevance, diversity and prestige in information networks
Many network-based ranking approaches have been proposed to rank objects according to different criteria, including relevance, prestige and diversity. However, existing approache...
Pan Du, Jiafeng Guo, Xueqi Cheng
ESA
2011
Springer
257views Algorithms» more  ESA 2011»
13 years 10 months ago
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
Josep Díaz, Alberto Marchetti-Spaccamela, D...