Sciweavers

9405 search results - page 325 / 1881
» Computing a Model of Set Theory
Sort
View
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
15 years 11 months ago
Equivalence verification of arithmetic datapaths with multiple word-length operands
Abstract: This paper addresses the problem of equivalence verification of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have diļ¬...
Namrata Shekhar, Priyank Kalla, Florian Enescu
140
Voted
IUI
2003
ACM
15 years 10 months ago
Inferring user goals from personality and behavior in a causal model of user affect
We present a probabilistic model, based on Dynamic Decision Networks, to assess user affect from possible causes of emotional arousal. The model relies on the OCC cognitive theory...
Xiaoming Zhou, Cristina Conati
142
Voted
AAAI
2010
15 years 6 months ago
Ordered Completion for First-Order Logic Programs on Finite Structures
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou
147
Voted
SAC
2006
ACM
15 years 11 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 11 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan