Sciweavers

7796 search results - page 199 / 1560
» On Generalized Schur Numbers
Sort
View
TAMC
2009
Springer
16 years 1 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
CEC
2007
IEEE
16 years 29 days ago
On some symmetry based validity indices
—Identification of the correct number of clusters and the corresponding partitioning are two important considerations in clustering. In this paper, a newly developed point symme...
Sriparna Saha, Sanghamitra Bandyopadhyay
GLOBECOM
2007
IEEE
16 years 29 days ago
Cellular Communication with Randomly Placed Distributed Antennas
Abstract— A cellular distributed antenna system with randomly located distributed antenna elements (AEs) and mobile users is considered. The AEs are connected to the base station...
Jun Zhang, Jeffrey G. Andrews
HPDC
2007
IEEE
16 years 29 days ago
How CN and P2P technologies may help build next-generation grids
With the evolution of technology, Grids cannot be considered any more solely as a federation of a modest number of powerful cluster computers. Trends show that future Grids will i...
Guillaume Pierre
AICT
2006
IEEE
16 years 21 days ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...