Sciweavers

2715 search results - page 451 / 543
» Network bucket testing
Sort
View
WDAG
2009
Springer
103views Algorithms» more  WDAG 2009»
14 years 2 months ago
Distributed Discovery of Large Near-Cliques
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
Zvika Brakerski, Boaz Patt-Shamir
ARCS
2009
Springer
14 years 2 months ago
Hybrid Resource Discovery Mechanism in Ad Hoc Grid Using Structured Overlay
Resource management has been an area of research in ad hoc grids for many years. Recently, different research projects have focused resource management in centralized, decentralize...
Tariq Abdullah, Luc Onana Alima, Vassiliy Sokolov,...
COMPLEX
2009
Springer
14 years 2 months ago
Retail Location Choice with Complementary Goods: An Agent-Based Model
This paper examines the emergence of retail clusters on a supply chain network comprised of suppliers, retailers, and consumers. An agent-based model is proposed to investigate ret...
Arthur Huang, David Levinson
FSTTCS
2009
Springer
14 years 2 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina
ISNN
2009
Springer
14 years 2 months ago
An Improved Quantum Evolutionary Algorithm with 2-Crossovers
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
Zhihui Xing, Haibin Duan, Chunfang Xu