Sciweavers

3974 search results - page 78 / 795
» Metric Functional Dependencies
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
MOR
2010
120views more  MOR 2010»
13 years 7 months ago
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz In
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
Hedy Attouch, Jérôme Bolte, Patrick R...
JSYML
2000
76views more  JSYML 2000»
13 years 9 months ago
Located Sets and Reverse Mathematics
Let X be a compact metric space. A closed set K X is located if the distance function d(x, K) exists as a continuous realvalued function on X; weakly located if the predicate d(x,...
Mariagnese Giusto, Stephen G. Simpson
ICDCS
2002
IEEE
14 years 2 months ago
A Reliable Multicast Algorithm for Mobile Ad Hoc Networks
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
Thiagaraja Gopalsamy, Mukesh Singhal, Dhabaleswar ...
EUROPAR
2007
Springer
14 years 3 months ago
Grid Resource Ranking Using Low-Level Performance Measurements
Abstract. This paper outlines a feasible approach to ranking Grid resources based on an easily obtainable application-specific performance model utilizing low-level performance me...
George Tsouloupas, Marios D. Dikaiakos