Sciweavers

1963 search results - page 307 / 393
» The Maximum Solution Problem on Graphs
Sort
View
99
Voted
ADHOC
2005
102views more  ADHOC 2005»
15 years 17 days ago
Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
Julien Cartigny, François Ingelrest, David ...
114
Voted
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 29 days ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
108
Voted
CVPR
2010
IEEE
15 years 3 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
90
Voted
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
15 years 7 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
MOBIHOC
2007
ACM
16 years 7 days ago
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...
Michele Garetto, Paolo Giaccone, Emilio Leonardi