Sciweavers

1282 search results - page 79 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 10 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
FLAIRS
2008
14 years 13 days ago
Distributed University Timetabling with Multiply Sectioned Constraint Networks
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
Yang Xiang, Wanling Zhang
ATAL
2003
Springer
14 years 3 months ago
A method for decentralized clustering in large multi-agent systems
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...
NCA
2008
IEEE
13 years 10 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
SASO
2008
IEEE
14 years 4 months ago
Self-Organized Synchronization in Wireless Network
We investigate periodic time synchronization of networks without centralized control, which can be modeled as a problem of aligning local variables taking values on a circle. Sync...
Jiang Yu, Olav Tirkkonen