Sciweavers

8197 search results - page 1108 / 1640
» Adaptive functional programming
Sort
View
200
Voted
CORR
2010
Springer
174views Education» more  CORR 2010»
15 years 7 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 7 months ago
An Indirect Genetic Algorithm for Set Covering Problems
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...
Uwe Aickelin
CORR
2008
Springer
92views Education» more  CORR 2008»
15 years 7 months ago
Nonnegative Matrix Factorization via Rank-One Downdate
Nonnegative matrix factorization (NMF) was popularized as a tool for data mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with nonnegative entries by a produ...
Michael Biggs, Ali Ghodsi, Stephen A. Vavasis
ADT
2006
15 years 7 months ago
TICP: Transport Information Collection Protocol
We present and validate TICP, a TCP-friendly reliable transport protocol to collect information from a large number of sources spread over the Internet. TICP is a stand-alone proto...
Chadi Barakat, Mohammad Malli, Naomichi Nonaka
JCST
2008
134views more  JCST 2008»
15 years 6 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li
« Prev « First page 1108 / 1640 Last » Next »