Sciweavers

4926 search results - page 379 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ICSE
2008
IEEE-ACM
16 years 4 months ago
CCVisu: automatic visual software decomposition
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
Dirk Beyer
PODC
2010
ACM
15 years 8 months ago
Brief announcement: on enhancing concurrency in distributed transactional memory
Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violatin...
Bo Zhang, Binoy Ravindran
123
Voted
ATAL
2010
Springer
15 years 5 months ago
Ants meeting algorithms
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
Asaf Shiloni, Alon Levy, Ariel Felner, Meir Kalech
P2P
2007
IEEE
104views Communications» more  P2P 2007»
15 years 11 months ago
How stable are large superpeer networks against attack?
In this paper, we analyze the stability of large scale superpeer networks against attacks. Two different kinds of attacks namely deterministic and degree dependent attack have bee...
Bivas Mitra, Sujoy Ghose, Niloy Ganguly
142
Voted
SIGMETRICS
2010
ACM
152views Hardware» more  SIGMETRICS 2010»
15 years 3 months ago
A fluid approximation for large-scale service systems
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
Yunan Liu, Ward Whitt