Sciweavers

2436 search results - page 206 / 488
» Evaluating Adaptive Problem Selection
Sort
View
150
Voted
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
15 years 8 months ago
Using memetic algorithms to improve portfolio performance in static and dynamic trading scenarios
The Portfolio Optimization problem consists of the selection of a group of assets to a long-term fund in order to minimize the risk and maximize the return of the investment. This...
Claus de Castro Aranha, Hitoshi Iba
TMC
2008
136views more  TMC 2008»
15 years 3 months ago
Efficient Resource Allocation for Wireless Multicast
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...
De-Nian Yang, Ming-Syan Chen
CVPR
2011
IEEE
15 years 1 months ago
Dynamic Batch Mode Active Learning
Active learning techniques have gained popularity in reducing human effort to annotate data instances for inducing a classifier. When faced with large quantities of unlabeled dat...
Shayok Chakraborty, Vineeth Balasubramanian, Sethu...
ICML
2005
IEEE
16 years 4 months ago
Reinforcement learning with Gaussian processes
Gaussian Process Temporal Difference (GPTD) learning offers a Bayesian solution to the policy evaluation problem of reinforcement learning. In this paper we extend the GPTD framew...
Yaakov Engel, Shie Mannor, Ron Meir
143
Voted
ESEM
2008
ACM
15 years 5 months ago
Pair programming: what's in it for me?
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, or code. Prior research on pair programming has primari...
Andrew Begel, Nachiappan Nagappan