1941 search results - page 69 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
HPDC
2007
IEEE
15 years 4 months ago
2007
IEEE
Tightly coupled parallel applications are increasingly run in Grid environments. Unfortunately, on many Grid sites the ability of machines to create or accept network connections ...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
CONEXT
2008
ACM
14 years 11 months ago
2008
ACM
We present the design, implementation, and evaluation of a Time Division Multiplex (TDM) MAC protocol for multihop wireless mesh networks using a programmable wireless platform. E...
DC
2010
14 years 10 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...