Sciweavers

1984 search results - page 384 / 397
» The colourful feasibility problem
Sort
View
CF
2008
ACM
13 years 12 months ago
A distributed evolutionary method to design scheduling policies for volunteer computing
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
Trilce Estrada, Olac Fuentes, Michela Taufer
MMM
2010
Springer
141views Multimedia» more  MMM 2010»
13 years 12 months ago
Slow Intelligence Systems
: Networks and distributed computing systems are becoming increasingly important and at the same time, more and more critical to the world of Information Technology. This rash spre...
Shi-Kuo Chang
CIKM
2008
Springer
13 years 11 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
13 years 11 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III