1480 search results - page 130 / 296 » Distributed algorithms for weighted problems in sparse graph... |
147
click to vote
IPL
2002
15 years 2 months ago
2002
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
127
click to vote
SIGMETRICS
2006
ACM
15 years 9 months ago
2006
ACM
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two tra...
128
click to vote
NIPS
2007
15 years 4 months ago
2007
Generalized linear models are the most commonly used tools to describe the stimulus selectivity of sensory neurons. Here we present a Bayesian treatment of such models. Using the ...
142
click to vote
AI
2007
Springer
15 years 3 months ago
2007
Springer
AI planning requires the definition of action models using a formal action and plan description language, such as the standard Planning Domain Definition Language (PDDL), as inp...
146
click to vote
CATS
1998
15 years 4 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...