Sciweavers

1388 search results - page 218 / 278
» Approximability of Robust Network Design
Sort
View
NICSO
2010
Springer
14 years 4 months ago
Evaluation of a Catalytic Search Algorithm
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
Lidia Yamamoto
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
14 years 4 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
INFOCOM
2003
IEEE
14 years 3 months ago
Opportunistic Fair Scheduling over Multiple Wireless Channels
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Yonghe Liu, Edward W. Knightly
GLOBECOM
2009
IEEE
14 years 1 months ago
Fair Energy-Efficient Resource Allocation over Fading TDMA Channels
In this paper, we consider the energy-efficient resource allocation that minimizes a general cost function of average user powers in wireless networks. A class of so-called -fair c...
Xin Wang, Di Wang, Hanqi Zhuang, Salvatore D. Morg...
AMI
2010
Springer
13 years 9 months ago
A Distributed Many-Camera System for Multi-person Tracking
This article presents a modular, distributed and scalable many-camera system designed towards tracking multiple people simultaneously in a natural human-robot interaction scenario ...
Claus Lenz, Thorsten Röder, Martin Eggers, Si...