Sciweavers

5153 search results - page 89 / 1031
» Introduction to Randomized Algorithms
Sort
View
CIKM
2009
Springer
16 years 23 days ago
Collaborative filtering using random neighbours in peer-to-peer networks
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...
Arno Bakker, Elth Ogston, Maarten van Steen
FOCS
2003
IEEE
15 years 11 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
AAAI
2011
14 years 6 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
EC
2008
120views ECommerce» more  EC 2008»
15 years 6 months ago
Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments
In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants...
Shengxiang Yang
IPPS
1999
IEEE
15 years 10 months ago
Better Deterministic Routing on Meshes
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
Jop F. Sibeyn