Sciweavers

914 search results - page 149 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
NIPS
2004
15 years 5 months ago
Identifying Protein-Protein Interaction Sites on a Genome-Wide Scale
Protein interactions typically arise from a physical interaction of one or more small sites on the surface of the two proteins. Identifying these sites is very important for drug ...
Haidong Wang, Eran Segal, Asa Ben-Hur, Daphne Koll...
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 5 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
RECSYS
2010
ACM
15 years 4 months ago
Recommending based on rating frequencies
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
Fatih Gedikli, Dietmar Jannach
JBI
2008
15 years 4 months ago
The Field Representation Language
The complexity of quantitative biomedical models, and the rate at which they are published, is increasing to a point where managing the information has become all but impossible w...
Guy Tsafnat
SIGPRO
2008
136views more  SIGPRO 2008»
15 years 4 months ago
Estimation of slowly varying parameters in nonlinear systems via symbolic dynamic filtering
This paper introduces a novel method for real-time estimation of slowly varying parameters in nonlinear dynamical systems. The core concept is built upon the principles of symboli...
Venkatesh Rajagopalan, Subhadeep Chakraborty, Asok...