Sciweavers

738 search results - page 55 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
DCC
2002
IEEE
15 years 9 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
BIRTHDAY
2005
Springer
15 years 3 months ago
Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...
David Harel, Hillel Kugler, Amir Pnueli
HAPTICS
2010
IEEE
15 years 1 months ago
Extended Rate-Hardness: A Measure for Perceived Hardness
This paper presents a measure for assessing the perceived hardness of a haptic surface based on associated physical variables. This metric, named extended rate-hardness (ERH), is e...
Gabjong Han, Seungmoon Choi
MOBICOM
2006
ACM
15 years 3 months ago
Stochastic event capture using mobile sensors subject to a quality metric
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
Nabhendra Bisnik, Alhussein A. Abouzeid, Volkan Is...
EGH
2010
Springer
14 years 7 months ago
GPU random numbers via the tiny encryption algorithm
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
Fahad Zafar, Marc Olano, Aaron Curtis