4377 search results - page 156 / 876 » Mass problems and randomness |
161
click to vote
WAOA
2005
Springer
15 years 12 months ago
2005
Springer
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...
182
click to vote
ECCC
2010
15 years 6 months ago
2010
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
180
click to vote
WOWMOM
2009
ACM
16 years 1 months ago
2009
ACM
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
197
click to vote
ICDM
2007
IEEE
16 years 25 days ago
2007
IEEE
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
183
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...