Sciweavers

1205 search results - page 78 / 241
» On P Systems with Bounded Parallelism
Sort
View
SPAA
2010
ACM
14 years 1 days ago
Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages
In dynamically multithreaded platforms that employ work stealing, there appears to be a fundamental tradeoff between providing provably good time and space bounds and supporting S...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
EUROPAR
2009
Springer
13 years 11 months ago
Surfing Peer-to-Peer IPTV: Distributed Channel Switching
It is now common for IPTV systems attracting millions of users to be based on a peer-to-peer (P2P) architecture. In such systems, each channel is typically associated with one P2P ...
Anne-Marie Kermarrec, Erwan Le Merrer, Yaning Liu,...
SAGA
2009
Springer
14 years 2 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel
ISMIR
2004
Springer
145views Music» more  ISMIR 2004»
14 years 1 months ago
Audio Fingerprinting In Peer-to-peer Networks
Despite the immense potential of Peer-to-Peer (P2P) networks in facilitating collaborative applications, they have become largely known as a free haven for pirated music swapping....
Prarthana Shrestha, Ton Kalker
EUROPAR
2004
Springer
14 years 1 months ago
Improving Data Cache Performance via Address Correlation: An Upper Bound Study
Address correlation is a technique that links the addresses that reference the same data values. Using a detailed source-code level analysis, a recent study [1] revealed that diffe...
Peng-fei Chuang, Resit Sendag, David J. Lilja