Sciweavers

3267 search results - page 578 / 654
» Generalized quasirandom graphs
Sort
View
TON
2008
122views more  TON 2008»
14 years 11 months ago
Distributed throughput maximization in wireless mesh networks via pre-partitioning
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
ALGORITHMICA
2002
84views more  ALGORITHMICA 2002»
14 years 11 months ago
Exploring Unknown Environments with Obstacles
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
Susanne Albers, Klaus Kursawe, Sven Schuierer
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
14 years 11 months ago
Kasteleyn Cokernels
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
Greg Kuperberg
ML
2000
ACM
150views Machine Learning» more  ML 2000»
14 years 11 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
14 years 10 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey