Sciweavers

2721 search results - page 152 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
CSE
2009
IEEE
15 years 1 months ago
Efficient Broadcast on Area of Interest in Voronoi Overlays
This paper presents an algorithm to perform the broadcasting of a packet to all the peers that are located into a convex region (Area of Interest) in a Voronoi based peer-topeer ne...
Michele Albano, Ranieri Baraglia, Matteo Mordacchi...
CEC
2007
IEEE
14 years 11 months ago
Random search can outperform mutation
— Efficient discovery of lowest level building blocks is a fundamental requirement for a successful genetic algorithm. Although considerable effort has been directed at techniqu...
Cameron Skinner, Patricia J. Riddle
KDD
2004
ACM
103views Data Mining» more  KDD 2004»
15 years 10 months ago
An objective evaluation criterion for clustering
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...
Arindam Banerjee, John Langford
PODC
2010
ACM
15 years 1 months ago
Brief announcement: complexity and solution of the send-receive correlation problem
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
Benito van der Zander, Egon Wanke, Wolfgang Kie&sz...
ICS
1994
Tsinghua U.
15 years 2 months ago
Evaluating automatic parallelization for efficient execution on shared-memory multiprocessors
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
Kathryn S. McKinley