Sciweavers

337 search results - page 46 / 68
» Network design with weighted players
Sort
View
OA
1989
237views Algorithms» more  OA 1989»
15 years 1 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
WOSP
2005
ACM
15 years 3 months ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills
76
Voted
ATAL
2009
Springer
15 years 4 months ago
A self-organizing neural network architecture for intentional planning agents
This paper presents a model of neural network embodiment of intentions and planning mechanisms for autonomous agents. The model bridges the dichotomy of symbolic and non-symbolic ...
Budhitama Subagdja, Ah-Hwee Tan
MMM
2005
Springer
148views Multimedia» more  MMM 2005»
15 years 3 months ago
Paving the Last Mile for Multi-Channel Multimedia Presentation Generation
Users of multimedia applications today are equipped with a variety of different (mobile) devices that each come with different operating systems, memory and CPU capabilities, netw...
Ansgar Scherp, Susanne Boll
INFORMATICALT
2011
170views more  INFORMATICALT 2011»
14 years 4 months ago
Community Detection Through Optimal Density Contrast of Adjacency Matrix
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...
Tianzhu Liang, Kwok Yip Szeto