Sciweavers

1277 search results - page 196 / 256
» Terminating Decision Algorithms Optimally
Sort
View
143
Voted
ICML
2006
IEEE
16 years 4 months ago
An analytic solution to discrete Bayesian reinforcement learning
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...
Pascal Poupart, Nikos A. Vlassis, Jesse Hoey, Kevi...
136
Voted
ICSE
2005
IEEE-ACM
16 years 3 months ago
A framework of greedy methods for constructing interaction test suites
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one ...
Charles J. Colbourn, Myra B. Cohen, Renée C...
132
Voted
EOR
2007
88views more  EOR 2007»
15 years 3 months ago
The stochastic location model with risk pooling
In this paper, we present a stochastic version of the Location Model with Risk Pooling (LMRP) that optimizes location, inventory, and allocation decisions under random parameters ...
Lawrence V. Snyder, Mark S. Daskin, Chung-Piaw Teo
135
Voted
LCN
2006
IEEE
15 years 9 months ago
Training on multiple sub-flows to optimise the use of Machine Learning classifiers in real-world IP networks
Literature on the use of machine learning (ML) algorithms for classifying IP traffic has relied on fullflows or the first few packets of flows. In contrast, many real-world scenar...
Thuy T. T. Nguyen, Grenville J. Armitage
151
Voted
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 7 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge