Sciweavers

3894 search results - page 570 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
DATE
2007
IEEE
141views Hardware» more  DATE 2007»
15 years 7 months ago
Energy-efficient real-time task scheduling with task rejection
In the past decade, energy-efficiency has been an important system design issue in both hardware and software managements. For mobile applications with critical missions, both ene...
Jian-Jia Chen, Tei-Wei Kuo, Chia-Lin Yang, Ku-Jei ...
JCO
2006
234views more  JCO 2006»
15 years 3 months ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 3 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
TON
2008
125views more  TON 2008»
15 years 3 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
ANOR
2010
130views more  ANOR 2010»
15 years 1 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...