Sciweavers

523 search results - page 61 / 105
» Structured Solution Methods for Non-Markovian Decision Proce...
Sort
View
163
Voted
AIPS
2000
15 years 6 months ago
On-line Scheduling via Sampling
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong
142
Voted
AI
2000
Springer
15 years 9 months ago
Keep It Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory
Abstract. Today’s case based reasoning applications face several challenges. In a typical application, the case bases grow at a very fast rate and their contents become increasin...
Qiang Yang, Jing Wu
PAMI
2011
15 years 11 days ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
15 years 13 days ago
Q-learning and enhanced policy iteration in discounted dynamic programming
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
Dimitri P. Bertsekas, Huizhen Yu
DAC
1999
ACM
15 years 9 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther