Sciweavers

156 search results - page 5 / 32
» Near-optimal Observation Selection using Submodular Function...
Sort
View
PERCOM
2007
ACM
14 years 7 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian
WSDM
2012
ACM
290views Data Mining» more  WSDM 2012»
12 years 3 months ago
Online selection of diverse results
The phenomenal growth in the volume of easily accessible information via various web-based services has made it essential for service providers to provide users with personalized ...
Debmalya Panigrahi, Atish Das Sarma, Gagan Aggarwa...
ANOR
2002
92views more  ANOR 2002»
13 years 7 months ago
Nash Equilibrium and Subgame Perfection in Observable Queues
A subgame perfection refinement of Nash equilibrium is suggested for games of the following type: each of an infinite number of identical players selects an action using his privat...
Refael Hassin, Moshe Haviv
ENTCS
2007
113views more  ENTCS 2007»
13 years 7 months ago
The Interactive Curry Observation Debugger iCODE
Debugging by observing the evaluation of expressions and functions is a useful approach for finding bugs in lazy functional and functional logic programs. However, adding and rem...
Parissa H. Sadeghi, Frank Huch
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
14 years 1 months ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
Jelle R. Kok, Nikos A. Vlassis