Sciweavers

4843 search results - page 145 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
UAI
2000
15 years 8 months ago
Value-Directed Belief State Approximation for POMDPs
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
Pascal Poupart, Craig Boutilier
ISAAC
2009
Springer
168views Algorithms» more  ISAAC 2009»
16 years 1 months ago
On the Camera Placement Problem
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
Rudolf Fleischer, Yihui Wang
AMC
2005
154views more  AMC 2005»
15 years 6 months ago
Solving Laplacian problems with boundary singularities: a comparison of a singular function boundary integral method with the p/
We solve a Laplacian problem over an L-shaped domain using a singular function boundary integral method as well as the p/hp finite element method. In the former method, the soluti...
Miltiades Elliotis, Georgios Georgiou, Christos Xe...
OL
2011
190views Neural Networks» more  OL 2011»
15 years 1 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
SIAMNUM
2010
108views more  SIAMNUM 2010»
15 years 1 months ago
Shear Locking in a Plane Elasticity Problem and the Enhanced Assumed Strain Method
The method of enhanced assumed strains (EAS) is a popular tool for avoiding locking phenomena, e.g., a remedy for shear locking in plane elasticity. We consider bending-dominated p...
Dietrich Braess, Pingbing Ming, Zhongci Shi