Sciweavers

2694 search results - page 176 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
HIPC
2004
Springer
15 years 11 months ago
Data Redistribution Algorithms for Homogeneous and Heterogeneous Processor Rings
Abstract. We consider the problem of redistributing data on homogeneous and heterogeneous processor rings. The problem arises in several applications, each time after a load-balanc...
Hélène Renard, Yves Robert, Fr&eacut...
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 11 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
175
Voted
JVA
2006
IEEE
16 years 2 days ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
MOBIHOC
2007
ACM
16 years 5 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
CVPR
2009
IEEE
1010views Computer Vision» more  CVPR 2009»
17 years 1 months ago
A Family of Contextual Measures of Similarity between Distributions with Application to Image Retrieval
During this talk, I will introduce a novel family of contextual measures of similarity between distributions: the similarity between two distributions q and p is measured in the co...
Florent Perronnin (Xerox Research Centre Europe), ...