Sciweavers

28888 search results - page 303 / 5778
» Computability and complexity in analysis
Sort
View
FOCS
1994
IEEE
15 years 10 months ago
On Rank vs. Communication Complexity
This paper concerns the open problem of Lov
Noam Nisan, Avi Wigderson
INFORMATICALT
2010
91views more  INFORMATICALT 2010»
15 years 5 months ago
An Expansion of the Neural Network Theory by Introducing Hebb Postulate
In the presented paper, some issues of the fundamental classical mechanics theory in the sense of Ising physics are introduced into the applied neural network area. The expansion o...
Algis Garliauskas
COMPUTING
2011
15 years 1 months ago
Cloud computing for small research groups in computational science and engineering: current status and outlook
Abstract Cloud computing could offer good business models for small CSE (Computational Science and Engineering) research groups because these groups often do not have enough human ...
Hong Linh Truong, Schahram Dustdar
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
16 years 18 hour ago
Analysing Randomized Distributed Algorithms
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
Gethin Norman
188
Voted
ECRTS
2010
IEEE
15 years 6 months ago
The Demand Bound Function Interface of Distributed Sporadic Pipelines of Tasks Scheduled by EDF
—In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end...
Nicola Serreli, Giuseppe Lipari, Enrico Bini