Sciweavers

341 search results - page 45 / 69
» Decision Complexity in Dynamic Geometry
Sort
View
UAI
2004
13 years 9 months ago
Region-Based Incremental Pruning for POMDPs
We present a major improvement to the incremental pruning algorithm for solving partially observable Markov decision processes. Our technique targets the cross-sum step of the dyn...
Zhengzhu Feng, Shlomo Zilberstein
DSS
2008
83views more  DSS 2008»
13 years 8 months ago
Knowledge discovery for adaptive negotiation agents in e-marketplaces
Intelligent software agents are promising in improving the effectiveness of e-marketplaces for e-commerce. Although a large amount of research has been conducted to develop negoti...
Raymond Y. K. Lau, Yuefeng Li, Dawei Song, Ron Chi...
VRST
2004
ACM
14 years 1 months ago
A CAVE system for interactive modeling of global illumination in car interior
Global illumination dramatically improves realistic appearance of rendered scenes, but usually it is neglected in VR systems due to its high costs. In this work we present an effi...
Kirill Dmitriev, Thomas Annen, Grzegorz Krawczyk, ...
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 2 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
CCGRID
2009
IEEE
13 years 9 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li