Sciweavers

1090 search results - page 179 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
CCCG
2009
13 years 8 months ago
Approximating Maximum Flow in Polygonal Domains using Spanners
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
Joondong Kim, Joseph S. B. Mitchell, Jingyu Zou
GLOBECOM
2008
IEEE
13 years 8 months ago
Cooperative Spectrum Allocation in Centralized Cognitive Networks Using Bipartite Matching
—Conflict free spectrum allocation for secondary users in cognitive networks is a challenging problem, since the accessible spectrum is shared among users. The problem becomes to...
Chengshi Zhao, Mingrui Zou, Bin Shen, Bumjung Kim,...
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
GIS
2005
ACM
14 years 8 months ago
Contraflow network reconfiguration for evacuation planning: a summary of results
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...
Sangho Kim, Shashi Shekhar
ICC
2007
IEEE
14 years 1 months ago
Optical WDM Network Planning Using Heterogeneous Multi-granularity OXCs
Multigranular optical WDM network aims to reduce network cost by grouping multiple wavelengths and then switching those wavelengths together at waveband or fiber levels. To configu...
Hong-Hsu Yen, Frank Yeong-Sung Lin, Steven S. W. L...