Sciweavers

478 search results - page 35 / 96
» Improving probability bounds by optimization over subsets
Sort
View
CIMCA
2008
IEEE
14 years 2 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis
SLS
2009
Springer
250views Algorithms» more  SLS 2009»
14 years 2 months ago
Running Time Analysis of ACO Systems for Shortest Path Problems
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
Christian Horoba, Dirk Sudholt
PIMRC
2008
IEEE
14 years 2 months ago
Comparative performance evaluation of MAC protocols in ad hoc networks with bandwidth partitioning
—This paper considers the performance of the MAC protocols ALOHA and CSMA in wireless ad hoc networks, where the total system bandwidth may be divided into smaller subbands. In t...
Mariam Kaynia, Geir E. Øien, Nihar Jindal, ...
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
14 years 1 months ago
A Genetic Approach for Gene Selection on Microarray Expression Data
Abstract. Microarrays allow simultaneous measurement of the expression levels of thousands of genes in cells under different physiological or disease states. Because the number of...
Yong-Hyuk Kim, Su-Yeon Lee, Byung Ro Moon
AI
1998
Springer
13 years 7 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf