Sciweavers

2924 search results - page 566 / 585
» Lower Bounds in Distributed Computing
Sort
View
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 5 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ICNP
2002
IEEE
15 years 4 months ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
RECOMB
2010
Springer
15 years 1 months ago
Algorithms for Detecting Significantly Mutated Pathways in Cancer
Abstract. Recent genome sequencing studies have shown that the somatic mutations that drive cancer development are distributed across a large number of genes. This mutational heter...
Fabio Vandin, Eli Upfal, Benjamin J. Raphael
ISRR
2005
Springer
118views Robotics» more  ISRR 2005»
15 years 5 months ago
A Provably Consistent Method for Imposing Sparsity in Feature-Based SLAM Information Filters
An open problem in Simultaneous Localization and Mapping (SLAM) is the development of algorithms which scale with the size of the environment. A few promising methods exploit the ...
Matthew Walter, Ryan Eustice, John J. Leonard
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
15 years 5 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...