Sciweavers

286 search results - page 3 / 58
» Design of heat exchanger networks using randomized algorithm
Sort
View
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 7 months ago
Distributed Sensor Localization in Random Environments using Minimal Number of Anchor Nodes
Abstract--The paper introduces DILOC, a distributed, iterative algorithm to locate sensors (with unknown locations) in 1, with respect to a minimal number of + 1 anchors with known...
Usman A. Khan, Soummya Kar, José M. F. Mour...
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 7 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...
GECCO
2003
Springer
103views Optimization» more  GECCO 2003»
14 years 28 days ago
Multicriteria Network Design Using Evolutionary Algorithm
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
Rajeev Kumar, Nilanjan Banerjee
INFOCOM
2012
IEEE
11 years 10 months ago
Multiple random walks to uncover short paths in power law networks
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
Bruno F. Ribeiro, Prithwish Basu, Don Towsley
ICALP
2005
Springer
14 years 1 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...