2457 search results - page 331 / 492 » Local Search with Bootstrapping |
148
click to vote
IJCAI
2001
15 years 5 months ago
2001
Most formulations of Reinforcement Learning depend on a single reinforcement reward value to guide the search for the optimal policy solution. If observation of this reward is rar...
133
click to vote
IJCAI
2001
15 years 5 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
137
Voted
IADIS
2003
15 years 5 months ago
2003
Our research focuses on web information management for people who want to monitor and use the World Wide Web (WWW) information, as their information resource. Web information is m...
143
click to vote
IJCAI
2003
15 years 5 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
100
click to vote
NIPS
2003
15 years 5 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...