7195 search results - page 180 / 1439 » On Computing Power |
ISSAC
1999
Springer
15 years 5 months ago
1999
Springer
In this paper we consider the problem of fast computation of n-ary products, for large n, over arbitrary precision integer or rational number domains. The combination of loop unro...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
111
click to vote
ISIM
2007
15 years 2 months ago
2007
We continue the investigation of P coloniesintroduced in [7], of abstract computing devices composed of independent agents, acting and evolving in a shared environment. We determin...
113
click to vote
WIOPT
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper we develop distributed approaches for power allocation and scheduling in wireless access networks. We consider a model where users communicate over a set of parallel...
126
click to vote
DAC
2008
ACM
15 years 2 months ago
2008
ACM
Clock skew scheduling has been traditionally considered as a tool for improving the clock period in a sequential circuit. Timing slack is "stolen" from fast combinationa...