Sciweavers

608 search results - page 33 / 122
» Random Systems with Complete Connections
Sort
View
DAIS
2011
13 years 1 months ago
Gozar: NAT-Friendly Peer Sampling with One-Hop Distributed NAT Traversal
Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) c...
Amir H. Payberah, Jim Dowling, Seif Haridi
HICSS
2009
IEEE
104views Biometrics» more  HICSS 2009»
14 years 4 months ago
Celebrating Diversity in Volunteer Computing
The computing resources in a volunteer computing system are highly diverse in terms of software and hardware type, speed, availability, reliability, network connectivity, and othe...
David P. Anderson, Kevin Reed
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
14 years 1 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
ESANN
2006
13 years 11 months ago
Cultures of dissociated neurons display a variety of avalanche behaviours
Avalanche dynamics has been described in organotypic cultures and acute slices from rat cortex. Its distinctive feature is a statistical distribution of avalanche size and duration...
Roberta Alessio, Laura Cozzi, Vittorio Sanguineti
FOSSACS
2006
Springer
14 years 1 months ago
A Finite Model Construction for Coalgebraic Modal Logic
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
Lutz Schröder