Sciweavers

2656 search results - page 192 / 532
» Design and analysis of algorithms reconsidered
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Model-free reinforcement learning as mixture learning
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
Nikos Vlassis, Marc Toussaint
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
16 years 2 days ago
Bayesian optimization models for particle swarms
We explore the use of information models as a guide for the development of single objective optimization algorithms, giving particular attention to the use of Bayesian models in a...
Christopher K. Monson, Kevin D. Seppi
ALT
2001
Springer
16 years 3 months ago
Inventing Discovery Tools: Combining Information Visualization with Data Mining
The growing use of information visualization tools and data mining algorithms stems from two separate lines of research. Information visualization researchers believe in the impor...
Ben Shneiderman
LATIN
1998
Springer
15 years 10 months ago
Dynamic Packet Routing on Arrays with Bounded Buffers
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
Andrei Z. Broder, Alan M. Frieze, Eli Upfal
CVIU
2008
75views more  CVIU 2008»
15 years 6 months ago
Performance characterization in computer vision: A guide to best practices
It is frequently remarked that designers of computer vision algorithms and systems cannot reliably predict how algorithms will respond to new problems. A variety of reasons have b...
Neil A. Thacker, Adrian F. Clark, John L. Barron, ...