Sciweavers

2714 search results - page 68 / 543
» Approximation Schemes for Scheduling
Sort
View
89
Voted
GLOBECOM
2006
IEEE
15 years 6 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
101
Voted
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 1 months ago
Yet another algorithm for dense max cut: go greedy
We study dense instances of MaxCut and its generalizations. Following a long list of existing, diverse and often sophisticated approximation schemes, we propose taking the na
Claire Mathieu, Warren Schudy
85
Voted
ICPR
2010
IEEE
14 years 10 months ago
Efficient Polygonal Approximation of Digital Curves via Monte Carlo Optimization
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
Xiuzhuang Zhou, Yao Lu
ICC
2007
IEEE
119views Communications» more  ICC 2007»
15 years 4 months ago
Energy-Efficient Multi-Hop Scheduling for Multi-Rate 802.15.3 WPANs
Abstract-- We propose an energy
Jinhui Shen, Ioanis Nikolaidis, Janelle J. Harms
DAC
2003
ACM
16 years 1 months ago
A tool for describing and evaluating hierarchical real-time bus scheduling policies
We present a tool suite for building, simulating, and analyzing the results of hierarchical descriptions of the scheduling policy for modules sharing a bus in real-time applicatio...
Trevor Meyerowitz, Claudio Pinello, Alberto L. San...