Sciweavers

4451 search results - page 55 / 891
» On Random Ordering Constraints
Sort
View
CAV
2004
Springer
151views Hardware» more  CAV 2004»
15 years 3 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
ISCAS
2008
IEEE
112views Hardware» more  ISCAS 2008»
15 years 6 months ago
Power optimization of weighted bit-product summation tree for elementary function generator
— In this paper we propose a method for lowering the power consumption in our previously proposed method for approximating elementary functions. By rearranging the interconnect o...
Saeeid Tahmasbi Oskuii, Kenny Johansson, Oscar Gus...
EUSFLAT
2009
114views Fuzzy Logic» more  EUSFLAT 2009»
14 years 9 months ago
The Use of Interval-Valued Probability Measures in Fuzzy Linear Programming: a constraint set approach
This paper uses a constraint set approach to linear programming problems with equality constraints whose coefficients and/or right-hand side values could be uncertain. We consider ...
Phantipa Thipwiwatpotjana, Weldon A. Lodwick
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
14 years 12 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
DAM
2008
116views more  DAM 2008»
14 years 12 months ago
Expected number of breakpoints after t random reversals in genomes with duplicate genes
In comparative genomics, one wishes to deduce the evolutionary distance between dierent species by studying their genomes. Using gene order information, we seek the number of time...
Niklas Eriksen