Sciweavers

459 search results - page 86 / 92
» Computational Complexity of Probabilistic Disambiguation
Sort
View
82
Voted
CSE
2009
IEEE
15 years 6 months ago
TagRec: Leveraging Tagging Wisdom for Recommendation
—Due to the exponential growth of information on the Web, Recommender Systems have been developed to generate suggestions to help users overcome information overload and sift thr...
Tom Chao Zhou, Hao Ma, Irwin King, Michael R. Lyu
GECCO
2009
Springer
15 years 6 months ago
Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
Philipp Rohlfshagen, Per Kristian Lehre, Xin Yao
ICDCS
2007
IEEE
15 years 6 months ago
Secure Event Dissemination in Publish-Subscribe Networks
Abstract. Content-based publish-subscribe (pub-sub) systems are an emerging paradigm for building large-scale information delivery systems. Secure event dissemination in a pub-sub ...
Mudhakar Srivatsa, Ling Liu
SOFSEM
2007
Springer
15 years 5 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
ICAS
2006
IEEE
171views Robotics» more  ICAS 2006»
15 years 5 months ago
Adaptive Approach to Information Dissemination in Self-Organizing Grids
The size, complexity, heterogeneity, and dynamism of largescale computational grids make autonomic grid services and solutions necessary. In particular, grid schedulers must map a...
Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Gh...