Sciweavers

666 search results - page 41 / 134
» The Pipelined Set Cover Problem
Sort
View
IWPEC
2004
Springer
14 years 3 months ago
A Structural View on Parameterizing Problems: Distance from Triviality
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
Jiong Guo, Falk Hüffner, Rolf Niedermeier
WADS
2007
Springer
184views Algorithms» more  WADS 2007»
14 years 4 months ago
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanj...
DAC
2004
ACM
14 years 3 months ago
Area-efficient instruction set synthesis for reconfigurable system-on-chip designs
Silicon compilers are often used in conjunction with Field Programmable Gate Arrays (FPGAs) to deliver flexibility, fast prototyping, and accelerated time-to-market. Many of these...
Philip Brisk, Adam Kaplan, Majid Sarrafzadeh
MOR
2008
169views more  MOR 2008»
13 years 10 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
IJSNET
2006
110views more  IJSNET 2006»
13 years 10 months ago
Improving network lifetime using sensors with adjustable sensing ranges
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
Mihaela Cardei, Jie Wu, Mingming Lu