Sciweavers

186 search results - page 20 / 38
» Priority Algorithms for the Subset-Sum Problem
Sort
View
DIALM
2010
ACM
194views Algorithms» more  DIALM 2010»
13 years 5 months ago
Prioritized gossip in vehicular networks
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
Alejandro Cornejo, Calvin C. Newport
CCGRID
2008
IEEE
14 years 2 months ago
A Proactive Non-Cooperative Game-Theoretic Framework for Data Replication in Data Grids
— Data grids and its cost effective nature has taken on a new level of interest in recent years; amalgamation of different providers results in increased capacity as well as lowe...
Ali Elghirani, Riky Subrata, Albert Y. Zomaya
CVIU
2008
180views more  CVIU 2008»
13 years 7 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
ICRA
2005
IEEE
122views Robotics» more  ICRA 2005»
14 years 1 months ago
Flocking with Obstacle Avoidance: A New Distributed Coordination Algorithm Based on Voronoi Partitions
— A new distributed coordination algorithm for multi-vehicle systems is presented in this paper. The algorithm combines a particular choice of navigation function with Voronoi pa...
Magnus Lindhé, Petter Ögren, Karl Henr...
ICNP
1998
IEEE
13 years 12 months ago
A Class of End-to-End Congestion Control Algorithms for the Internet
We formulate end-to-end congestion control as a global optimization problem. Based on this formulation, a class of minimum cost flow control (MCFC) algorithms for adjusting sessio...
S. Jamaloddin Golestani, S. Bhattacharyya