Sciweavers

1941 search results - page 145 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
HPCC
2007
Springer
16 years 1 months ago
A Complex Network-Based Approach for Job Scheduling in Grid Environments
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
Renato Porfirio Ishii, Rodrigo Fernandes de Mello,...
SPAA
2010
ACM
15 years 11 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
171
Voted
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
15 years 11 months ago
Controlled synchronization via nonlinear integral coupling
— This paper considers the problems of controlled synchronization and regulation of oscillatory systems. For a specific class of nonlinear systems, namely for minimum phase syst...
Alexey V. Pavlov, Erik Steur, Nathan van de Wouw
IPPS
2000
IEEE
15 years 11 months ago
Job Scheduling that Minimizes Network Contention due to both Communication and I/O
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performan...
Jens Mache, Virginia Mary Lo, Sharad Garg
267
Voted
MST
2010
187views more  MST 2010»
15 years 1 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda