Sciweavers

423 search results - page 66 / 85
» Multi-objective Model Checking of Markov Decision Processes
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 3 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
AAAI
2006
13 years 10 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
MONET
2006
141views more  MONET 2006»
13 years 8 months ago
An Energy-Optimal Algorithm for Neighbor Discovery in Wireless Sensor Networks
We consider sensor networks in which individual nodes with on-board sensing and low-power transmitters and receivers establish connections with neighboring nodes. The overall objec...
Ritesh Madan, Sanjay Lall
INFOCOM
2011
IEEE
13 years 1 days ago
A high-throughput routing metric for reliable multicast in multi-rate wireless mesh networks
Abstract—We propose a routing metric for enabling highthroughput reliable multicast in multi-rate wireless mesh networks. This new multicast routing metric, called expected multi...
Xin Zhao, Jun Guo, Chun Tung Chou, Archan Misra, S...
CVPR
2007
IEEE
14 years 10 months ago
Online Detection of Fire in Video
This paper describes an online learning based method to detect flames in video by processing the data generated by an ordinary camera monitoring a scene. Our fire detection method...
A. Enis Çetin, B. Ugur Töreyin