Sciweavers

148 search results - page 28 / 30
» Optimizing random walk search algorithms in P2P networks
Sort
View
PE
2010
Springer
170views Optimization» more  PE 2010»
13 years 5 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
CP
2003
Springer
14 years 20 days ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
WWW
2008
ACM
14 years 8 months ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
GECCO
2010
Springer
254views Optimization» more  GECCO 2010»
14 years 7 days ago
Evolving viral marketing strategies
One method of viral marketing involves seeding certain consumers within a population to encourage faster adoption of the product throughout the entire population. However, determi...
Forrest Stonedahl, William Rand, Uri Wilensky
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 2 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...