450 search results - page 23 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
106
click to vote
DAC
1995
ACM
15 years 3 months ago
1995
ACM
In this paper we present a set cover based approach (SCP) to multi-way partitioning for minimum delay for Look-Up Table based FPGAs. SCP minimizes the number of chip-crossings on ...
SIAMSC
2010
14 years 10 months ago
2010
Abstract. In this paper we improve traditional steepest descent methods for the direct minimization of the Gross-Pitaevskii (GP) energy with rotation at two levels. We first defi...
ADHOCNOW
2009
Springer
15 years 29 days ago
2009
Springer
Abstract. In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has h...
ARCS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract: We present a formal framework to talk and reason about dependable systems. The framework is based on three distinct classes of (system specification) properties we call s...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...