Sciweavers

2754 search results - page 53 / 551
» Distributed Weighted Matching
Sort
View
INFOCOM
2000
IEEE
14 years 27 days ago
The Throughput of Data Switches with and without Speedup
— In this paper we use fluid model techniques to establish two results concerning the throughput of data switches. For an input-queued switch (with no speedup) we show that a ma...
J. G. Dai, Balaji Prabhakar
COMBINATORICS
2006
103views more  COMBINATORICS 2006»
13 years 8 months ago
A Note on Domino Shuffling
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
É. Janvresse, T. de la Rue, Y. Velenik
ICDCS
2000
IEEE
14 years 27 days ago
Partitionable Light-Weight Groups
Group communication, providing virtual synchrony semantics, is a powerful paradigm for building distributed applications. For applications that require a large number of groups, s...
Luís Rodrigues, Katherine Guo
COGSCI
2006
81views more  COGSCI 2006»
13 years 8 months ago
Relations, Objects, and the Composition of Analogies
This research addresses the kinds of matching elements that determine analogical relatedness and literal similarity. Despite theoretical agreement on the importance of relational ...
Dedre Gentner, Kenneth J. Kurtz
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
14 years 1 months ago
Ant System for the k-Cardinality Tree Problem
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
Thang Nguyen Bui, Gnanasekaran Sundarraj