Sciweavers

16404 search results - page 108 / 3281
» A set coverage problem
Sort
View
CHI
1994
ACM
15 years 7 months ago
Using aggregation and dynamic queries for exploring large data sets
When working with large data sets, users perform three primary types of activities: data manipulation, data analysis, and data visualization. The data manipulation process involve...
Jade Goldstein, Steven F. Roth
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
16 years 2 days ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser
COR
2006
75views more  COR 2006»
15 years 3 months ago
Extensions to emergency vehicle location models
This paper is concerned with extending models for the maximal covering location problem in two ways. First, the usual 0
Othman Ibraheem Alsalloum, Graham K. Rand
INFOCOM
2008
IEEE
15 years 9 months ago
On Maximizing the Lifetime of Delay-Sensitive Wireless Sensor Networks with Anycast
—Sleep-wake scheduling is an effective mechanism to prolong the lifetime of energy-constrained wireless sensor networks. However, it incurs an additional delay for packet deliver...
Joohwan Kim, Xiaojun Lin, Ness B. Shroff, Prasun S...
VLSID
2005
IEEE
120views VLSI» more  VLSID 2005»
15 years 8 months ago
On Finding Consecutive Test Vectors in a Random Sequence for Energy-Aware BIST Design
During pseudorandom testing, a significant amount of energy and test application time is wasted for generating and for applying “useless” test vectors that do not contribute t...
Sheng Zhang, Sharad C. Seth, Bhargab B. Bhattachar...