Sciweavers

2421 search results - page 132 / 485
» Approximate Flow-Aware Networking
Sort
View
INFOCOM
2009
IEEE
15 years 10 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
ERCIMDL
2007
Springer
87views Education» more  ERCIMDL 2007»
15 years 9 months ago
A Model of Uncertainty for Near-Duplicates in Document Reference Networks
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
Claudia Hess, Michel de Rougemont
GLOBECOM
2006
IEEE
15 years 9 months ago
Throughput Guarantees for Wireless Networks with Opportunistic Scheduling
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...
Vegard Hassel, Geir E. Øien, David Gesbert
122
Voted
ESA
2006
Springer
109views Algorithms» more  ESA 2006»
15 years 7 months ago
Multiline Addressing by Network Flow
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
Friedrich Eisenbrand, Andreas Karrenbauer, Martin ...
IJSNET
2007
100views more  IJSNET 2007»
15 years 3 months ago
Fault tolerant topology control for one-to-all communications in symmetric wireless networks
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...
Feng Wang 0002, Kuai Xu, My T. Thai, Ding-Zhu Du