Sciweavers

2323 search results - page 56 / 465
» Power optimization for connectivity problems
Sort
View
IOR
2011
175views more  IOR 2011»
13 years 4 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
IPCO
2007
94views Optimization» more  IPCO 2007»
13 years 11 months ago
Infrastructure Leasing Problems
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
Barbara M. Anthony, Anupam Gupta
COCOON
2007
Springer
14 years 3 months ago
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Yuli Ye, Allan Borodin
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
13 years 7 months ago
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
Donatello Materassi, Giacomo Innocenti, Laura Giar...
ICC
2007
IEEE
125views Communications» more  ICC 2007»
14 years 4 months ago
A Delay-Bounded Dynamic Interactive Power Control Algorithm for VANETs
— To enable real-time and robust message delivery, the highly mobile Vehicular Ad Hoc Networks (VANETs) call for comprehensive investigation on the dynamic power control effects ...
Chunxiao Chigan, Jialiang Li