Sciweavers

1095 search results - page 69 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 6 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
156
Voted
HIPC
2009
Springer
15 years 7 days ago
Highly scalable algorithm for distributed real-time text indexing
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
Ankur Narang, Vikas Agarwal, Monu Kedia, Vijay K. ...
IPPS
2002
IEEE
15 years 7 months ago
Hierarchical Interconnects for On-Chip Clustering
In the sub-micron technology era, wire delays are becoming much more important than gate delays, making it particularly attractive to go for clustered designs. A common form of cl...
Aneesh Aggarwal, Manoj Franklin
IPPS
2002
IEEE
15 years 7 months ago
Enforcing Resource Sharing Agreements among Distributed Server Clusters
Future scalable, high throughput, and high performance applications are likely to execute on platforms constructed by clustering multiple autonomous distributed servers, with reso...
Tao Zhao, Vijay Karamcheti
COLCOM
2007
IEEE
15 years 8 months ago
Kademlia for data storage and retrieval in enterprise networks
— Centralized organization of current enterprise networks doesn’t represent an ideal solution in terms of information security and reliability. Denial of service, packet filter...
Natalya Fedotova, Stefano Fanti, Luca Veltri