1380 search results - page 67 / 276 » Computing the optimal strategy to commit to |
AAECC
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
IEEEPACT
2002
IEEE
14 years 21 days ago
2002
IEEE
Traditional compilers perform their code generation tasks based on a fixed, pre-determined instruction set. This paper describes the implementation of a compiler that determines ...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
In this paper we present an optimization solution for power and performance management in a platform running multiple independent applications. Our approach assumes a virtualized ...
ICNC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Humans have the ability to flexibly adjust their information processing strategy according to situational characteristics. However, such ability has been largely overloo...
PODC
1998
ACM
14 years 5 hour ago
1998
ACM
We study the relationship between the number of rounds needed to repeatedly perform a private computation i.e., where there are many sets of inputs sequentially given to the play...