Sciweavers

18155 search results - page 44 / 3631
» Point
Sort
View
AAAI
2008
15 years 1 days ago
Generalized Point Based Value Iteration for Interactive POMDPs
We develop a point based method for solving finitely nested interactive POMDPs approximately. Analogously to point based value iteration (PBVI) in POMDPs, we maintain a set of bel...
Prashant Doshi, Dennis Perez
WSC
2008
15 years 22 hour ago
Simulating point processes by intensity projection
Point processes with stochastic intensities are ubiquitous in many application areas, including finance, insurance, reliability and queuing. They can be simulated from standard Po...
Kay Giesecke, Hossein Kakavand, Mohammad Mousavi
APPROX
2008
Springer
95views Algorithms» more  APPROX 2008»
14 years 11 months ago
Sweeping Points
Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points to a target point using a sequence of sweeps? In a sweep, the sweep-line is plac...
Adrian Dumitrescu, Minghui Jiang
LFP
1992
78views more  LFP 1992»
14 years 11 months ago
A Syntactic Approach to Fixed Point Computation on Finite Domains
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
Tyng-Ruey Chuang, Benjamin Goldberg
ALGORITHMICA
2010
72views more  ALGORITHMICA 2010»
14 years 9 months ago
Largest and Smallest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
Maarten Löffler, Marc J. van Kreveld