Sciweavers

2223 search results - page 123 / 445
» Ontological Framework for Approximation
Sort
View
INFOCOM
2003
IEEE
15 years 10 months ago
Blocking Probabilities of Optical Burst Switching Networks Based on Reduced Load Fixed Point Approximations
— This paper provides a framework for analysis and performance evaluation of Optical Burst Switching (OBS) networks. In particular, a new reduced load fixed point approximation ...
Zvi Rosberg, Hai Le Vu, Moshe Zukerman, Jolyon Whi...
AIPS
2004
15 years 6 months ago
Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
Branislav Kveton, Milos Hauskrecht
NIPS
2003
15 years 6 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan
162
Voted
MST
2007
90views more  MST 2007»
15 years 4 months ago
Optimal Semicomputable Approximations to Reachable and Invariant Sets
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity, in which computations a...
Pieter Collins
JAIR
2006
160views more  JAIR 2006»
15 years 5 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun