657 search results - page 10 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
125
click to vote
OL
2011
14 years 6 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
98
Voted
TCS
2008
14 years 11 months ago
2008
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
VLSID
2002
IEEE
16 years 23 hour ago
2002
IEEE
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
115
click to vote
ISAAC
2000
Springer
15 years 3 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
128
click to vote
TMM
2010
14 years 6 months ago
2010
Abstract--In peer-to-peer (P2P) live streaming using unstructured mesh, packet scheduling is an important factor in overall playback delay. In this paper, we propose a scheduling a...