Sciweavers

1578 search results - page 141 / 316
» Algorithmic randomness of continuous functions
Sort
View
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
13 years 1 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 10 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
GECCO
2003
Springer
130views Optimization» more  GECCO 2003»
14 years 3 months ago
A New Approach to Improve Particle Swarm Optimization
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
Liping Zhang, Huanjun Yu, Shangxu Hu
VLDB
2004
ACM
134views Database» more  VLDB 2004»
14 years 3 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
TIT
2008
61views more  TIT 2008»
13 years 10 months ago
A Probabilistic Upper Bound on Differential Entropy
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution...
Erik G. Learned-Miller, Joseph DeStefano