Sciweavers

4276 search results - page 244 / 856
» Computability of Probability Distributions and Distribution ...
Sort
View
PODC
2009
ACM
16 years 5 months ago
Concurrent imitation dynamics in congestion games
Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our d...
Heiner Ackermann, Petra Berenbrink, Simon Fischer,...
SPAA
2005
ACM
15 years 10 months ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi
SPAA
2005
ACM
15 years 10 months ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder
IPPS
1999
IEEE
15 years 9 months ago
A Parallel Phoneme Recognition Algorithm Based on Continuous Hidden Markov Model
This paper presents a parallel phoneme recognition algorithm based on the continuous Hidden Markov Model (HMM). The parallel phoneme recognition algorithm distributes 3-state HMMs...
Sang-Hwa Chung, Min-Uk Park, Hyung-Soon Kim
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz