Sciweavers

229 search results - page 11 / 46
» A General Name Binding Mechanism
Sort
View
IJCAI
2001
13 years 11 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
COR
2010
150views more  COR 2010»
13 years 10 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...
GECCO
2003
Springer
268views Optimization» more  GECCO 2003»
14 years 3 months ago
A Generalized Feedforward Neural Network Architecture and Its Training Using Two Stochastic Search Methods
Shunting Inhibitory Artificial Neural Networks (SIANNs) are biologically inspired networks in which the synaptic interactions are mediated via a nonlinear mechanism called shuntin...
Abdesselam Bouzerdoum, Rainer Mueller
TKDE
2008
378views more  TKDE 2008»
13 years 9 months ago
Modeling Image Data for Effective Indexing and Retrieval in Large General Image Databases
In this paper, we propose an image semantic model based on the knowledge and criteria in the field of linguistics and taxonomy. Our work bridges the "semantic gap" by sea...
Xiaoyan Li, Lidan Shou, Gang Chen, Tianlei Hu, Jin...
CCS
2007
ACM
14 years 4 months ago
An analysis of browser domain-isolation bugs and a light-weight transparent defense mechanism
Browsers’ isolation mechanisms are critical to users’ safety and privacy on the web. Achieving proper isolations, however, is very difficult. Historical data show that even fo...
Shuo Chen, David Ross, Yi-Min Wang